./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:54:11,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:54:11,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:54:11,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:54:11,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:54:11,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:54:11,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:54:11,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:54:11,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:54:11,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:54:11,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:54:11,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:54:11,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:54:11,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:54:11,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:54:11,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:54:11,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:54:11,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:54:11,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:54:11,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:54:11,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:54:11,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:54:11,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:54:11,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:54:11,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:54:11,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:54:11,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:54:11,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:54:11,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:54:11,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:54:11,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:54:11,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:54:11,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:54:11,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:54:11,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:54:11,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:54:11,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:54:11,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:54:11,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:54:11,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:54:11,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:54:11,275 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 00:54:11,314 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:54:11,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:54:11,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:54:11,315 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:54:11,316 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:54:11,316 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:54:11,316 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 00:54:11,316 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:54:11,317 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:54:11,317 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 00:54:11,317 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 00:54:11,317 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:54:11,317 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 00:54:11,318 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 00:54:11,318 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 00:54:11,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:54:11,319 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:54:11,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 00:54:11,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:54:11,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:54:11,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:54:11,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:54:11,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:54:11,320 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:54:11,321 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:54:11,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:54:11,321 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:54:11,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:54:11,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:54:11,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:54:11,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:11,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:54:11,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:54:11,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:54:11,323 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 00:54:11,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 00:54:11,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:54:11,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:54:11,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:54:11,324 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/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_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e [2021-11-07 00:54:11,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:54:11,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:54:11,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:54:11,626 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:54:11,627 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:54:11,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2021-11-07 00:54:11,702 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/data/5e58422a3/36190f5e93ea469b8f3225658ebe2b8a/FLAG6d2b089b9 [2021-11-07 00:54:12,379 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:54:12,380 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2021-11-07 00:54:12,406 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/data/5e58422a3/36190f5e93ea469b8f3225658ebe2b8a/FLAG6d2b089b9 [2021-11-07 00:54:12,614 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/data/5e58422a3/36190f5e93ea469b8f3225658ebe2b8a [2021-11-07 00:54:12,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:54:12,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:54:12,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:12,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:54:12,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:54:12,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:12" (1/1) ... [2021-11-07 00:54:12,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc12fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:12, skipping insertion in model container [2021-11-07 00:54:12,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:12" (1/1) ... [2021-11-07 00:54:12,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:54:12,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:54:12,878 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-07 00:54:13,280 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2021-11-07 00:54:13,293 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2021-11-07 00:54:13,320 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2021-11-07 00:54:13,323 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2021-11-07 00:54:13,335 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2021-11-07 00:54:13,336 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2021-11-07 00:54:13,357 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2021-11-07 00:54:13,358 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2021-11-07 00:54:13,361 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2021-11-07 00:54:13,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:13,371 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:54:13,394 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-07 00:54:13,432 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2021-11-07 00:54:13,434 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2021-11-07 00:54:13,440 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2021-11-07 00:54:13,447 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2021-11-07 00:54:13,453 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2021-11-07 00:54:13,454 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2021-11-07 00:54:13,459 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2021-11-07 00:54:13,463 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2021-11-07 00:54:13,466 WARN L228 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_df469578-4400-4d2e-a0a9-372c85df6560/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2021-11-07 00:54:13,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:13,550 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:54:13,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13 WrapperNode [2021-11-07 00:54:13,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:13,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:13,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:54:13,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:54:13,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:13,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:54:13,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:54:13,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:54:13,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:54:13,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:54:13,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:54:13,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:54:13,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (1/1) ... [2021-11-07 00:54:13,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:13,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:54:13,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:54:13,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:54:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2021-11-07 00:54:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2021-11-07 00:54:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 00:54:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:54:13,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:54:13,829 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-07 00:54:14,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:54:14,709 INFO L299 CfgBuilder]: Removed 40 assume(true) statements. [2021-11-07 00:54:14,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:14 BoogieIcfgContainer [2021-11-07 00:54:14,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:54:14,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:54:14,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:54:14,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:54:14,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:54:12" (1/3) ... [2021-11-07 00:54:14,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9ceb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:14, skipping insertion in model container [2021-11-07 00:54:14,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:13" (2/3) ... [2021-11-07 00:54:14,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9ceb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:14, skipping insertion in model container [2021-11-07 00:54:14,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:14" (3/3) ... [2021-11-07 00:54:14,720 INFO L111 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2021-11-07 00:54:14,725 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-07 00:54:14,725 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:54:14,726 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-07 00:54:14,726 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-07 00:54:14,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,775 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,775 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,776 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,776 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,776 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,776 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,776 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,777 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,777 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,777 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,777 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,777 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,777 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,778 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,778 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,778 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,778 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,778 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,779 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,779 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,779 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,780 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,780 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,780 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,781 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,781 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,781 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,783 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,784 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,785 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,785 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,785 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,787 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,788 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,789 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,789 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,789 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,790 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,790 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,790 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,790 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,791 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,791 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,791 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,791 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,791 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,792 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,792 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,793 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,794 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,794 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,794 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,802 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,802 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,802 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,802 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,804 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,804 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,805 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,805 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,806 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,806 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,806 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,807 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,807 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,807 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,807 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,807 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,807 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,807 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,808 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,808 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,809 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,809 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,809 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,809 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,810 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,810 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,810 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,810 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,810 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,810 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,811 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,811 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,812 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,813 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,813 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,813 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,813 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,813 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,813 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,814 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,816 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,816 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,817 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,817 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,820 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,820 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,820 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,820 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,820 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,820 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,822 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,822 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,822 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,822 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,822 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,822 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,823 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,823 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,823 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,823 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,823 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,823 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,823 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,824 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,824 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,824 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,825 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,825 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,825 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,826 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,827 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,866 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,867 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,867 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,867 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,867 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,867 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,867 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,868 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,868 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,868 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,868 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,868 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,868 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,869 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,869 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,869 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,869 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,869 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,869 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,870 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,870 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,870 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,870 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,870 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,870 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,871 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,871 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,871 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,871 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,871 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,871 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,872 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,872 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,872 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,872 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,872 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,872 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,875 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,877 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,878 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,878 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,878 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,878 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,878 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,879 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,879 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,879 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,879 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,879 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,879 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,880 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,880 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,880 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,880 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,880 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,880 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,881 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,881 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,881 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,881 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,881 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,882 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,882 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,882 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,882 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,882 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,882 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,883 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,885 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,885 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,886 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,886 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,886 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,886 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,886 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,887 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,890 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,890 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,891 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,891 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,891 WARN L322 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:14,899 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-11-07 00:54:14,946 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:54:14,952 INFO L339 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:54:14,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-11-07 00:54:14,974 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-07 00:54:14,985 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 442 places, 471 transitions, 950 flow [2021-11-07 00:54:14,988 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 442 places, 471 transitions, 950 flow [2021-11-07 00:54:14,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 442 places, 471 transitions, 950 flow [2021-11-07 00:54:15,204 INFO L129 PetriNetUnfolder]: 33/470 cut-off events. [2021-11-07 00:54:15,204 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-07 00:54:15,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 470 events. 33/470 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1104 event pairs, 0 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 330. Up to 3 conditions per place. [2021-11-07 00:54:15,249 INFO L116 LiptonReduction]: Number of co-enabled transitions 32400 [2021-11-07 00:55:42,107 WARN L207 SmtUtils]: Spent 6.95 s on a formula simplification. DAG size of input: 256 DAG size of output: 236 [2021-11-07 00:55:45,127 INFO L131 LiptonReduction]: Checked pairs total: 138103 [2021-11-07 00:55:45,127 INFO L133 LiptonReduction]: Total number of compositions: 498 [2021-11-07 00:55:45,137 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 121 transitions, 250 flow [2021-11-07 00:55:45,208 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1451 states, 1440 states have (on average 2.301388888888889) internal successors, (3314), 1450 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 1451 states, 1440 states have (on average 2.301388888888889) internal successors, (3314), 1450 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-07 00:55:45,220 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:45,221 INFO L513 BasicCegarLoop]: trace histogram [1] [2021-11-07 00:55:45,222 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1666, now seen corresponding path program 1 times [2021-11-07 00:55:45,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:45,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866429292] [2021-11-07 00:55:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:45,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:45,353 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:45,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866429292] [2021-11-07 00:55:45,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866429292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:45,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:45,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-07 00:55:45,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30842203] [2021-11-07 00:55:45,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 00:55:45,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:45,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 00:55:45,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 00:55:45,384 INFO L87 Difference]: Start difference. First operand has 1451 states, 1440 states have (on average 2.301388888888889) internal successors, (3314), 1450 states have internal predecessors, (3314), 0 states have call successors, (0), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:45,437 INFO L93 Difference]: Finished difference Result 1450 states and 3256 transitions. [2021-11-07 00:55:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 00:55:45,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2021-11-07 00:55:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:45,522 INFO L225 Difference]: With dead ends: 1450 [2021-11-07 00:55:45,522 INFO L226 Difference]: Without dead ends: 1450 [2021-11-07 00:55:45,523 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 00:55:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2021-11-07 00:55:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2021-11-07 00:55:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1440 states have (on average 2.261111111111111) internal successors, (3256), 1449 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 3256 transitions. [2021-11-07 00:55:45,650 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 3256 transitions. Word has length 1 [2021-11-07 00:55:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:45,650 INFO L470 AbstractCegarLoop]: Abstraction has 1450 states and 3256 transitions. [2021-11-07 00:55:45,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 3256 transitions. [2021-11-07 00:55:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 00:55:45,652 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:45,652 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 00:55:45,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 00:55:45,654 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1533317593, now seen corresponding path program 1 times [2021-11-07 00:55:45,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:45,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306578986] [2021-11-07 00:55:45,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:45,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:45,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:45,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306578986] [2021-11-07 00:55:45,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306578986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:45,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:45,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:55:45,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992417928] [2021-11-07 00:55:45,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:55:45,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:45,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:55:45,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:55:45,848 INFO L87 Difference]: Start difference. First operand 1450 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2021-11-07 00:55:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:45,920 INFO L93 Difference]: Finished difference Result 2723 states and 6126 transitions. [2021-11-07 00:55:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:55:45,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2021-11-07 00:55:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:45,941 INFO L225 Difference]: With dead ends: 2723 [2021-11-07 00:55:45,941 INFO L226 Difference]: Without dead ends: 2723 [2021-11-07 00:55:45,942 INFO L786 BasicCegarLoop]: 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 [2021-11-07 00:55:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2021-11-07 00:55:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 1469. [2021-11-07 00:55:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1459 states have (on average 2.259081562714188) internal successors, (3296), 1468 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2021-11-07 00:55:46,003 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 6 [2021-11-07 00:55:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:46,004 INFO L470 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2021-11-07 00:55:46,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2021-11-07 00:55:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2021-11-07 00:55:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 00:55:46,005 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:46,005 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:46,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 00:55:46,006 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash 286046090, now seen corresponding path program 1 times [2021-11-07 00:55:46,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:46,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953948609] [2021-11-07 00:55:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:46,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:46,105 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:46,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953948609] [2021-11-07 00:55:46,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953948609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:46,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:46,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:55:46,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374712231] [2021-11-07 00:55:46,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:55:46,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:46,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:55:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:55:46,108 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:46,123 INFO L93 Difference]: Finished difference Result 1469 states and 3277 transitions. [2021-11-07 00:55:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:55:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-11-07 00:55:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:46,134 INFO L225 Difference]: With dead ends: 1469 [2021-11-07 00:55:46,134 INFO L226 Difference]: Without dead ends: 1469 [2021-11-07 00:55:46,135 INFO L786 BasicCegarLoop]: 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 [2021-11-07 00:55:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2021-11-07 00:55:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2021-11-07 00:55:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1459 states have (on average 2.246058944482522) internal successors, (3277), 1468 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3277 transitions. [2021-11-07 00:55:46,222 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3277 transitions. Word has length 7 [2021-11-07 00:55:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:46,222 INFO L470 AbstractCegarLoop]: Abstraction has 1469 states and 3277 transitions. [2021-11-07 00:55:46,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3277 transitions. [2021-11-07 00:55:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 00:55:46,224 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:46,224 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:46,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 00:55:46,225 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 284841962, now seen corresponding path program 1 times [2021-11-07 00:55:46,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:46,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894530348] [2021-11-07 00:55:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:46,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:46,401 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:46,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894530348] [2021-11-07 00:55:46,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894530348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:46,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:46,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 00:55:46,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401764888] [2021-11-07 00:55:46,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:55:46,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:55:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:55:46,404 INFO L87 Difference]: Start difference. First operand 1469 states and 3277 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:46,994 INFO L93 Difference]: Finished difference Result 1855 states and 4138 transitions. [2021-11-07 00:55:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 00:55:46,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-07 00:55:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:47,008 INFO L225 Difference]: With dead ends: 1855 [2021-11-07 00:55:47,009 INFO L226 Difference]: Without dead ends: 1855 [2021-11-07 00:55:47,009 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-07 00:55:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2021-11-07 00:55:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1576. [2021-11-07 00:55:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1566 states have (on average 2.2490421455938696) internal successors, (3522), 1575 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3522 transitions. [2021-11-07 00:55:47,079 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3522 transitions. Word has length 8 [2021-11-07 00:55:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:47,080 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 3522 transitions. [2021-11-07 00:55:47,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3522 transitions. [2021-11-07 00:55:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 00:55:47,085 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:47,085 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:47,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 00:55:47,085 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:47,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1144440174, now seen corresponding path program 1 times [2021-11-07 00:55:47,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:47,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053216338] [2021-11-07 00:55:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:47,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:47,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:47,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053216338] [2021-11-07 00:55:47,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053216338] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:47,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:47,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 00:55:47,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199198917] [2021-11-07 00:55:47,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:55:47,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:55:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:55:47,249 INFO L87 Difference]: Start difference. First operand 1576 states and 3522 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:47,353 INFO L93 Difference]: Finished difference Result 2584 states and 5768 transitions. [2021-11-07 00:55:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:55:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-07 00:55:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:47,374 INFO L225 Difference]: With dead ends: 2584 [2021-11-07 00:55:47,374 INFO L226 Difference]: Without dead ends: 2584 [2021-11-07 00:55:47,375 INFO L786 BasicCegarLoop]: 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 [2021-11-07 00:55:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2021-11-07 00:55:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 1633. [2021-11-07 00:55:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1623 states have (on average 2.243992606284658) internal successors, (3642), 1632 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 3642 transitions. [2021-11-07 00:55:47,442 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 3642 transitions. Word has length 10 [2021-11-07 00:55:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:47,443 INFO L470 AbstractCegarLoop]: Abstraction has 1633 states and 3642 transitions. [2021-11-07 00:55:47,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 3642 transitions. [2021-11-07 00:55:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 00:55:47,445 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:47,445 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:47,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 00:55:47,446 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:47,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 581821113, now seen corresponding path program 1 times [2021-11-07 00:55:47,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:47,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261426439] [2021-11-07 00:55:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:47,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:47,700 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:47,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261426439] [2021-11-07 00:55:47,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261426439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:47,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:47,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 00:55:47,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801997572] [2021-11-07 00:55:47,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 00:55:47,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 00:55:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-07 00:55:47,702 INFO L87 Difference]: Start difference. First operand 1633 states and 3642 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:49,596 INFO L93 Difference]: Finished difference Result 2027 states and 4502 transitions. [2021-11-07 00:55:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:55:49,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-07 00:55:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:49,616 INFO L225 Difference]: With dead ends: 2027 [2021-11-07 00:55:49,616 INFO L226 Difference]: Without dead ends: 2027 [2021-11-07 00:55:49,617 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2021-11-07 00:55:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2021-11-07 00:55:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1642. [2021-11-07 00:55:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1632 states have (on average 2.2438725490196076) internal successors, (3662), 1641 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 3662 transitions. [2021-11-07 00:55:49,689 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 3662 transitions. Word has length 14 [2021-11-07 00:55:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:49,690 INFO L470 AbstractCegarLoop]: Abstraction has 1642 states and 3662 transitions. [2021-11-07 00:55:49,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 3662 transitions. [2021-11-07 00:55:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 00:55:49,692 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:49,692 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:49,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 00:55:49,693 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash -134651263, now seen corresponding path program 2 times [2021-11-07 00:55:49,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:49,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715544962] [2021-11-07 00:55:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:49,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:49,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:49,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715544962] [2021-11-07 00:55:49,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715544962] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:49,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:49,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:55:49,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598976844] [2021-11-07 00:55:49,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:55:49,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:55:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:55:49,956 INFO L87 Difference]: Start difference. First operand 1642 states and 3662 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:52,211 INFO L93 Difference]: Finished difference Result 2073 states and 4601 transitions. [2021-11-07 00:55:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 00:55:52,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-07 00:55:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:52,230 INFO L225 Difference]: With dead ends: 2073 [2021-11-07 00:55:52,230 INFO L226 Difference]: Without dead ends: 2073 [2021-11-07 00:55:52,231 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2021-11-07 00:55:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2021-11-07 00:55:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1649. [2021-11-07 00:55:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1639 states have (on average 2.24405125076266) internal successors, (3678), 1648 states have internal predecessors, (3678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 3678 transitions. [2021-11-07 00:55:52,298 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 3678 transitions. Word has length 14 [2021-11-07 00:55:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:52,299 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 3678 transitions. [2021-11-07 00:55:52,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 3678 transitions. [2021-11-07 00:55:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 00:55:52,301 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:52,301 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:52,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 00:55:52,302 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:52,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1088991211, now seen corresponding path program 3 times [2021-11-07 00:55:52,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:52,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334502174] [2021-11-07 00:55:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:52,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:52,567 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:52,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334502174] [2021-11-07 00:55:52,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334502174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:52,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:52,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:55:52,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038834650] [2021-11-07 00:55:52,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:55:52,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:55:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:55:52,569 INFO L87 Difference]: Start difference. First operand 1649 states and 3678 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:54,053 INFO L93 Difference]: Finished difference Result 2040 states and 4531 transitions. [2021-11-07 00:55:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 00:55:54,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-07 00:55:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:54,069 INFO L225 Difference]: With dead ends: 2040 [2021-11-07 00:55:54,069 INFO L226 Difference]: Without dead ends: 2040 [2021-11-07 00:55:54,071 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2021-11-07 00:55:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2021-11-07 00:55:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1642. [2021-11-07 00:55:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1632 states have (on average 2.2438725490196076) internal successors, (3662), 1641 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 3662 transitions. [2021-11-07 00:55:54,132 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 3662 transitions. Word has length 14 [2021-11-07 00:55:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:54,132 INFO L470 AbstractCegarLoop]: Abstraction has 1642 states and 3662 transitions. [2021-11-07 00:55:54,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 3662 transitions. [2021-11-07 00:55:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 00:55:54,134 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:54,134 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:54,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 00:55:54,134 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:54,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash 42719029, now seen corresponding path program 1 times [2021-11-07 00:55:54,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:54,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993523189] [2021-11-07 00:55:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:54,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:54,350 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:54,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993523189] [2021-11-07 00:55:54,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993523189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:54,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:54,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 00:55:54,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469399762] [2021-11-07 00:55:54,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 00:55:54,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 00:55:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 00:55:54,352 INFO L87 Difference]: Start difference. First operand 1642 states and 3662 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:55,274 INFO L93 Difference]: Finished difference Result 2487 states and 5509 transitions. [2021-11-07 00:55:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 00:55:55,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-07 00:55:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:55,297 INFO L225 Difference]: With dead ends: 2487 [2021-11-07 00:55:55,297 INFO L226 Difference]: Without dead ends: 2401 [2021-11-07 00:55:55,298 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:55:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-11-07 00:55:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1800. [2021-11-07 00:55:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1790 states have (on average 2.2692737430167598) internal successors, (4062), 1799 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 4062 transitions. [2021-11-07 00:55:55,362 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 4062 transitions. Word has length 14 [2021-11-07 00:55:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:55,363 INFO L470 AbstractCegarLoop]: Abstraction has 1800 states and 4062 transitions. [2021-11-07 00:55:55,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 4062 transitions. [2021-11-07 00:55:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:55:55,364 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:55,364 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:55,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 00:55:55,365 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:55,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1753387361, now seen corresponding path program 1 times [2021-11-07 00:55:55,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:55,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104545478] [2021-11-07 00:55:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:55,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:55,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:55,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104545478] [2021-11-07 00:55:55,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104545478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:55,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:55,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 00:55:55,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851876015] [2021-11-07 00:55:55,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 00:55:55,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 00:55:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-07 00:55:55,585 INFO L87 Difference]: Start difference. First operand 1800 states and 4062 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:57,532 INFO L93 Difference]: Finished difference Result 2234 states and 5009 transitions. [2021-11-07 00:55:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:55:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:55:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:57,557 INFO L225 Difference]: With dead ends: 2234 [2021-11-07 00:55:57,557 INFO L226 Difference]: Without dead ends: 2234 [2021-11-07 00:55:57,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2021-11-07 00:55:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2021-11-07 00:55:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1813. [2021-11-07 00:55:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1803 states have (on average 2.2689961175818083) internal successors, (4091), 1812 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 4091 transitions. [2021-11-07 00:55:57,653 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 4091 transitions. Word has length 15 [2021-11-07 00:55:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:55:57,653 INFO L470 AbstractCegarLoop]: Abstraction has 1813 states and 4091 transitions. [2021-11-07 00:55:57,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 4091 transitions. [2021-11-07 00:55:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:55:57,655 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:55:57,655 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:55:57,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 00:55:57,657 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:55:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:55:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash 856354637, now seen corresponding path program 2 times [2021-11-07 00:55:57,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:55:57,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508857905] [2021-11-07 00:55:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:55:57,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:55:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:55:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:55:57,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:55:57,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508857905] [2021-11-07 00:55:57,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508857905] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:55:57,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:55:57,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 00:55:57,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148771110] [2021-11-07 00:55:57,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:55:57,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:55:57,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:55:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:55:57,954 INFO L87 Difference]: Start difference. First operand 1813 states and 4091 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:55:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:55:59,938 INFO L93 Difference]: Finished difference Result 2472 states and 5524 transitions. [2021-11-07 00:55:59,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 00:55:59,938 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:55:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:55:59,947 INFO L225 Difference]: With dead ends: 2472 [2021-11-07 00:55:59,948 INFO L226 Difference]: Without dead ends: 2472 [2021-11-07 00:55:59,948 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2021-11-07 00:55:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2021-11-07 00:56:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1850. [2021-11-07 00:56:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1840 states have (on average 2.2706521739130436) internal successors, (4178), 1849 states have internal predecessors, (4178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 4178 transitions. [2021-11-07 00:56:00,027 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 4178 transitions. Word has length 15 [2021-11-07 00:56:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:00,028 INFO L470 AbstractCegarLoop]: Abstraction has 1850 states and 4178 transitions. [2021-11-07 00:56:00,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 4178 transitions. [2021-11-07 00:56:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:00,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:00,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:00,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 00:56:00,030 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 676790822, now seen corresponding path program 1 times [2021-11-07 00:56:00,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:00,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746701784] [2021-11-07 00:56:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:00,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:00,229 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:00,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746701784] [2021-11-07 00:56:00,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746701784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:00,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:00,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 00:56:00,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239934133] [2021-11-07 00:56:00,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 00:56:00,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:00,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 00:56:00,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-07 00:56:00,231 INFO L87 Difference]: Start difference. First operand 1850 states and 4178 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:01,199 INFO L93 Difference]: Finished difference Result 2102 states and 4709 transitions. [2021-11-07 00:56:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 00:56:01,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:01,205 INFO L225 Difference]: With dead ends: 2102 [2021-11-07 00:56:01,206 INFO L226 Difference]: Without dead ends: 2102 [2021-11-07 00:56:01,206 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:56:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2021-11-07 00:56:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1842. [2021-11-07 00:56:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1832 states have (on average 2.26146288209607) internal successors, (4143), 1841 states have internal predecessors, (4143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 4143 transitions. [2021-11-07 00:56:01,258 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 4143 transitions. Word has length 15 [2021-11-07 00:56:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:01,259 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 4143 transitions. [2021-11-07 00:56:01,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 4143 transitions. [2021-11-07 00:56:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:01,260 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:01,260 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:01,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 00:56:01,261 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 666469682, now seen corresponding path program 2 times [2021-11-07 00:56:01,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:01,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723335066] [2021-11-07 00:56:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:01,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:01,691 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:01,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723335066] [2021-11-07 00:56:01,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723335066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:01,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:01,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:56:01,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695813677] [2021-11-07 00:56:01,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:56:01,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:01,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:56:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:56:01,693 INFO L87 Difference]: Start difference. First operand 1842 states and 4143 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:04,109 INFO L93 Difference]: Finished difference Result 2485 states and 5551 transitions. [2021-11-07 00:56:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:56:04,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:04,116 INFO L225 Difference]: With dead ends: 2485 [2021-11-07 00:56:04,116 INFO L226 Difference]: Without dead ends: 2485 [2021-11-07 00:56:04,117 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2021-11-07 00:56:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2021-11-07 00:56:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 1873. [2021-11-07 00:56:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1863 states have (on average 2.2619431025228125) internal successors, (4214), 1872 states have internal predecessors, (4214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4214 transitions. [2021-11-07 00:56:04,180 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4214 transitions. Word has length 15 [2021-11-07 00:56:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:04,180 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 4214 transitions. [2021-11-07 00:56:04,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4214 transitions. [2021-11-07 00:56:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:04,182 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:04,182 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:04,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 00:56:04,183 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash 364388942, now seen corresponding path program 3 times [2021-11-07 00:56:04,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:04,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842762775] [2021-11-07 00:56:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:04,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:04,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:04,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842762775] [2021-11-07 00:56:04,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842762775] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:04,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:04,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 00:56:04,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005659890] [2021-11-07 00:56:04,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:56:04,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:56:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:56:04,502 INFO L87 Difference]: Start difference. First operand 1873 states and 4214 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:08,105 INFO L93 Difference]: Finished difference Result 2294 states and 5121 transitions. [2021-11-07 00:56:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-07 00:56:08,106 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:08,112 INFO L225 Difference]: With dead ends: 2294 [2021-11-07 00:56:08,112 INFO L226 Difference]: Without dead ends: 2294 [2021-11-07 00:56:08,113 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=469, Invalid=1171, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 00:56:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2021-11-07 00:56:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 1873. [2021-11-07 00:56:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1863 states have (on average 2.2619431025228125) internal successors, (4214), 1872 states have internal predecessors, (4214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4214 transitions. [2021-11-07 00:56:08,166 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4214 transitions. Word has length 15 [2021-11-07 00:56:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:08,167 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 4214 transitions. [2021-11-07 00:56:08,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4214 transitions. [2021-11-07 00:56:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:08,168 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:08,168 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:08,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 00:56:08,169 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1473803434, now seen corresponding path program 4 times [2021-11-07 00:56:08,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:08,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071054707] [2021-11-07 00:56:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:08,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:08,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:08,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071054707] [2021-11-07 00:56:08,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071054707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:08,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:08,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 00:56:08,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824655385] [2021-11-07 00:56:08,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:56:08,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:08,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:56:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:56:08,505 INFO L87 Difference]: Start difference. First operand 1873 states and 4214 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:11,410 INFO L93 Difference]: Finished difference Result 2358 states and 5263 transitions. [2021-11-07 00:56:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 00:56:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:11,417 INFO L225 Difference]: With dead ends: 2358 [2021-11-07 00:56:11,417 INFO L226 Difference]: Without dead ends: 2358 [2021-11-07 00:56:11,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=471, Invalid=1169, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 00:56:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2021-11-07 00:56:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 1877. [2021-11-07 00:56:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1867 states have (on average 2.261381896089984) internal successors, (4222), 1876 states have internal predecessors, (4222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 4222 transitions. [2021-11-07 00:56:11,501 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 4222 transitions. Word has length 15 [2021-11-07 00:56:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:11,501 INFO L470 AbstractCegarLoop]: Abstraction has 1877 states and 4222 transitions. [2021-11-07 00:56:11,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 4222 transitions. [2021-11-07 00:56:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:11,503 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:11,503 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:11,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 00:56:11,504 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1349742934, now seen corresponding path program 5 times [2021-11-07 00:56:11,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:11,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111787004] [2021-11-07 00:56:11,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:11,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:11,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:11,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111787004] [2021-11-07 00:56:11,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111787004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:11,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:11,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:56:11,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267206027] [2021-11-07 00:56:11,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:56:11,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:11,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:56:11,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:56:11,875 INFO L87 Difference]: Start difference. First operand 1877 states and 4222 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:13,940 INFO L93 Difference]: Finished difference Result 2413 states and 5382 transitions. [2021-11-07 00:56:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 00:56:13,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:13,948 INFO L225 Difference]: With dead ends: 2413 [2021-11-07 00:56:13,948 INFO L226 Difference]: Without dead ends: 2413 [2021-11-07 00:56:13,949 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2021-11-07 00:56:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2021-11-07 00:56:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 1879. [2021-11-07 00:56:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1869 states have (on average 2.262172284644195) internal successors, (4228), 1878 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4228 transitions. [2021-11-07 00:56:14,002 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4228 transitions. Word has length 15 [2021-11-07 00:56:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:14,002 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 4228 transitions. [2021-11-07 00:56:14,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4228 transitions. [2021-11-07 00:56:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:14,004 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:14,004 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:14,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 00:56:14,004 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 344170978, now seen corresponding path program 6 times [2021-11-07 00:56:14,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:14,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575147703] [2021-11-07 00:56:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:14,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:14,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:14,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575147703] [2021-11-07 00:56:14,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575147703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:14,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:14,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 00:56:14,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549714728] [2021-11-07 00:56:14,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:56:14,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:56:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:56:14,298 INFO L87 Difference]: Start difference. First operand 1879 states and 4228 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:17,502 INFO L93 Difference]: Finished difference Result 2396 states and 5341 transitions. [2021-11-07 00:56:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 00:56:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:17,510 INFO L225 Difference]: With dead ends: 2396 [2021-11-07 00:56:17,510 INFO L226 Difference]: Without dead ends: 2396 [2021-11-07 00:56:17,511 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=452, Invalid=1108, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 00:56:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2021-11-07 00:56:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1886. [2021-11-07 00:56:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1876 states have (on average 2.261727078891258) internal successors, (4243), 1885 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) [2021-11-07 00:56:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 4243 transitions. [2021-11-07 00:56:17,561 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 4243 transitions. Word has length 15 [2021-11-07 00:56:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:17,561 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 4243 transitions. [2021-11-07 00:56:17,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 4243 transitions. [2021-11-07 00:56:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:17,563 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:17,563 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:17,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 00:56:17,563 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash -713909962, now seen corresponding path program 7 times [2021-11-07 00:56:17,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:17,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854520294] [2021-11-07 00:56:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:17,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:17,884 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:17,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854520294] [2021-11-07 00:56:17,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854520294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:17,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:17,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 00:56:17,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242479667] [2021-11-07 00:56:17,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:56:17,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:56:17,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:56:17,888 INFO L87 Difference]: Start difference. First operand 1886 states and 4243 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:21,280 INFO L93 Difference]: Finished difference Result 2612 states and 5827 transitions. [2021-11-07 00:56:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-07 00:56:21,282 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:21,285 INFO L225 Difference]: With dead ends: 2612 [2021-11-07 00:56:21,285 INFO L226 Difference]: Without dead ends: 2612 [2021-11-07 00:56:21,286 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2021-11-07 00:56:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2021-11-07 00:56:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 1907. [2021-11-07 00:56:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1897 states have (on average 2.264101212440696) internal successors, (4295), 1906 states have internal predecessors, (4295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 4295 transitions. [2021-11-07 00:56:21,334 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 4295 transitions. Word has length 15 [2021-11-07 00:56:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:21,334 INFO L470 AbstractCegarLoop]: Abstraction has 1907 states and 4295 transitions. [2021-11-07 00:56:21,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 4295 transitions. [2021-11-07 00:56:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:21,336 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:21,336 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:21,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 00:56:21,336 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1886131612, now seen corresponding path program 8 times [2021-11-07 00:56:21,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:21,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576416112] [2021-11-07 00:56:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:21,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:21,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:21,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576416112] [2021-11-07 00:56:21,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576416112] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:21,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:21,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 00:56:21,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806722498] [2021-11-07 00:56:21,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:56:21,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:21,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:56:21,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:56:21,658 INFO L87 Difference]: Start difference. First operand 1907 states and 4295 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:25,137 INFO L93 Difference]: Finished difference Result 2864 states and 6388 transitions. [2021-11-07 00:56:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-07 00:56:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:25,141 INFO L225 Difference]: With dead ends: 2864 [2021-11-07 00:56:25,141 INFO L226 Difference]: Without dead ends: 2864 [2021-11-07 00:56:25,142 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=409, Invalid=923, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 00:56:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2021-11-07 00:56:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1914. [2021-11-07 00:56:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1904 states have (on average 2.2673319327731094) internal successors, (4317), 1913 states have internal predecessors, (4317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4317 transitions. [2021-11-07 00:56:25,207 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4317 transitions. Word has length 15 [2021-11-07 00:56:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:25,207 INFO L470 AbstractCegarLoop]: Abstraction has 1914 states and 4317 transitions. [2021-11-07 00:56:25,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4317 transitions. [2021-11-07 00:56:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:56:25,209 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:25,209 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:25,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 00:56:25,209 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1066921226, now seen corresponding path program 9 times [2021-11-07 00:56:25,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:25,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565212596] [2021-11-07 00:56:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:25,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:25,533 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:25,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565212596] [2021-11-07 00:56:25,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565212596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:25,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:25,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 00:56:25,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668689280] [2021-11-07 00:56:25,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:56:25,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:25,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:56:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:56:25,534 INFO L87 Difference]: Start difference. First operand 1914 states and 4317 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:28,661 INFO L93 Difference]: Finished difference Result 2610 states and 5821 transitions. [2021-11-07 00:56:28,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 00:56:28,662 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 00:56:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:28,665 INFO L225 Difference]: With dead ends: 2610 [2021-11-07 00:56:28,665 INFO L226 Difference]: Without dead ends: 2610 [2021-11-07 00:56:28,665 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=325, Invalid=731, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 00:56:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2021-11-07 00:56:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 1870. [2021-11-07 00:56:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1860 states have (on average 2.261827956989247) internal successors, (4207), 1869 states have internal predecessors, (4207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 4207 transitions. [2021-11-07 00:56:28,712 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 4207 transitions. Word has length 15 [2021-11-07 00:56:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:28,713 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 4207 transitions. [2021-11-07 00:56:28,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 4207 transitions. [2021-11-07 00:56:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 00:56:28,714 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:28,714 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:28,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 00:56:28,715 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash -557933582, now seen corresponding path program 1 times [2021-11-07 00:56:28,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:28,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600632751] [2021-11-07 00:56:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:28,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:28,947 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:28,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600632751] [2021-11-07 00:56:28,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600632751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:28,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:28,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 00:56:28,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989433576] [2021-11-07 00:56:28,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 00:56:28,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 00:56:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:56:28,949 INFO L87 Difference]: Start difference. First operand 1870 states and 4207 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:31,142 INFO L93 Difference]: Finished difference Result 2439 states and 5432 transitions. [2021-11-07 00:56:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 00:56:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 00:56:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:31,146 INFO L225 Difference]: With dead ends: 2439 [2021-11-07 00:56:31,146 INFO L226 Difference]: Without dead ends: 2439 [2021-11-07 00:56:31,147 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 00:56:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2021-11-07 00:56:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1878. [2021-11-07 00:56:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1868 states have (on average 2.2617773019271947) internal successors, (4225), 1877 states have internal predecessors, (4225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 4225 transitions. [2021-11-07 00:56:31,189 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 4225 transitions. Word has length 16 [2021-11-07 00:56:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:31,190 INFO L470 AbstractCegarLoop]: Abstraction has 1878 states and 4225 transitions. [2021-11-07 00:56:31,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 4225 transitions. [2021-11-07 00:56:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 00:56:31,191 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:31,191 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:31,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 00:56:31,192 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -421553942, now seen corresponding path program 2 times [2021-11-07 00:56:31,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:31,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538730254] [2021-11-07 00:56:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:31,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:31,463 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:31,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538730254] [2021-11-07 00:56:31,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538730254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:31,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:31,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 00:56:31,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201389952] [2021-11-07 00:56:31,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 00:56:31,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:31,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 00:56:31,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:56:31,465 INFO L87 Difference]: Start difference. First operand 1878 states and 4225 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:33,215 INFO L93 Difference]: Finished difference Result 2379 states and 5308 transitions. [2021-11-07 00:56:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:56:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 00:56:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:33,219 INFO L225 Difference]: With dead ends: 2379 [2021-11-07 00:56:33,219 INFO L226 Difference]: Without dead ends: 2379 [2021-11-07 00:56:33,220 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2021-11-07 00:56:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2021-11-07 00:56:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1883. [2021-11-07 00:56:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1873 states have (on average 2.262146289375334) internal successors, (4237), 1882 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 4237 transitions. [2021-11-07 00:56:33,264 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 4237 transitions. Word has length 16 [2021-11-07 00:56:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:33,264 INFO L470 AbstractCegarLoop]: Abstraction has 1883 states and 4237 transitions. [2021-11-07 00:56:33,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 4237 transitions. [2021-11-07 00:56:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 00:56:33,266 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:33,266 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:33,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 00:56:33,267 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1874090886, now seen corresponding path program 3 times [2021-11-07 00:56:33,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:33,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289170332] [2021-11-07 00:56:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:33,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:33,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:33,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289170332] [2021-11-07 00:56:33,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289170332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:33,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:33,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 00:56:33,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417511646] [2021-11-07 00:56:33,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 00:56:33,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:33,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 00:56:33,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:56:33,533 INFO L87 Difference]: Start difference. First operand 1883 states and 4237 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:35,803 INFO L93 Difference]: Finished difference Result 2537 states and 5652 transitions. [2021-11-07 00:56:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:56:35,804 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 00:56:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:35,807 INFO L225 Difference]: With dead ends: 2537 [2021-11-07 00:56:35,807 INFO L226 Difference]: Without dead ends: 2537 [2021-11-07 00:56:35,807 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2021-11-07 00:56:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2021-11-07 00:56:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 1849. [2021-11-07 00:56:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1839 states have (on average 2.2610114192495923) internal successors, (4158), 1848 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 4158 transitions. [2021-11-07 00:56:35,855 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 4158 transitions. Word has length 16 [2021-11-07 00:56:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:35,855 INFO L470 AbstractCegarLoop]: Abstraction has 1849 states and 4158 transitions. [2021-11-07 00:56:35,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 4158 transitions. [2021-11-07 00:56:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:56:35,857 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:35,857 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:35,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 00:56:35,858 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash 526346068, now seen corresponding path program 1 times [2021-11-07 00:56:35,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:35,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856001500] [2021-11-07 00:56:35,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:35,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:36,350 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:36,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856001500] [2021-11-07 00:56:36,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856001500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:36,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:36,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:56:36,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847929137] [2021-11-07 00:56:36,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:56:36,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:56:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:56:36,352 INFO L87 Difference]: Start difference. First operand 1849 states and 4158 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:41,243 INFO L93 Difference]: Finished difference Result 2860 states and 6424 transitions. [2021-11-07 00:56:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-07 00:56:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:56:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:41,248 INFO L225 Difference]: With dead ends: 2860 [2021-11-07 00:56:41,249 INFO L226 Difference]: Without dead ends: 2860 [2021-11-07 00:56:41,250 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=527, Invalid=1453, Unknown=0, NotChecked=0, Total=1980 [2021-11-07 00:56:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2021-11-07 00:56:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2010. [2021-11-07 00:56:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2000 states have (on average 2.2785) internal successors, (4557), 2009 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4557 transitions. [2021-11-07 00:56:41,302 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4557 transitions. Word has length 17 [2021-11-07 00:56:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:41,303 INFO L470 AbstractCegarLoop]: Abstraction has 2010 states and 4557 transitions. [2021-11-07 00:56:41,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4557 transitions. [2021-11-07 00:56:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:56:41,305 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:41,305 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:41,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 00:56:41,306 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1014998836, now seen corresponding path program 2 times [2021-11-07 00:56:41,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:41,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361916032] [2021-11-07 00:56:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:41,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:41,748 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:41,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361916032] [2021-11-07 00:56:41,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361916032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:41,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:41,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:56:41,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691869988] [2021-11-07 00:56:41,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:56:41,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:56:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:56:41,773 INFO L87 Difference]: Start difference. First operand 2010 states and 4557 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:45,788 INFO L93 Difference]: Finished difference Result 3281 states and 7431 transitions. [2021-11-07 00:56:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-07 00:56:45,789 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:56:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:45,793 INFO L225 Difference]: With dead ends: 3281 [2021-11-07 00:56:45,793 INFO L226 Difference]: Without dead ends: 3281 [2021-11-07 00:56:45,794 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=451, Invalid=1355, Unknown=0, NotChecked=0, Total=1806 [2021-11-07 00:56:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2021-11-07 00:56:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 2020. [2021-11-07 00:56:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2010 states have (on average 2.2781094527363184) internal successors, (4579), 2019 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4579 transitions. [2021-11-07 00:56:45,846 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4579 transitions. Word has length 17 [2021-11-07 00:56:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:45,846 INFO L470 AbstractCegarLoop]: Abstraction has 2020 states and 4579 transitions. [2021-11-07 00:56:45,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4579 transitions. [2021-11-07 00:56:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:56:45,848 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:45,848 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:45,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 00:56:45,849 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash -23727412, now seen corresponding path program 3 times [2021-11-07 00:56:45,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:45,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315275915] [2021-11-07 00:56:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:45,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:46,425 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:46,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315275915] [2021-11-07 00:56:46,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315275915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:46,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:46,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:56:46,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361387554] [2021-11-07 00:56:46,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:56:46,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:56:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:56:46,426 INFO L87 Difference]: Start difference. First operand 2020 states and 4579 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:50,362 INFO L93 Difference]: Finished difference Result 3364 states and 7654 transitions. [2021-11-07 00:56:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-07 00:56:50,363 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:56:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:50,367 INFO L225 Difference]: With dead ends: 3364 [2021-11-07 00:56:50,367 INFO L226 Difference]: Without dead ends: 3364 [2021-11-07 00:56:50,368 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 00:56:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2021-11-07 00:56:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2041. [2021-11-07 00:56:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2031 states have (on average 2.2801575578532742) internal successors, (4631), 2040 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 4631 transitions. [2021-11-07 00:56:50,417 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 4631 transitions. Word has length 17 [2021-11-07 00:56:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:50,417 INFO L470 AbstractCegarLoop]: Abstraction has 2041 states and 4631 transitions. [2021-11-07 00:56:50,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 4631 transitions. [2021-11-07 00:56:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:56:50,419 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:50,419 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:50,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 00:56:50,420 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash 34936836, now seen corresponding path program 4 times [2021-11-07 00:56:50,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:50,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474062531] [2021-11-07 00:56:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:50,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:50,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:50,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474062531] [2021-11-07 00:56:50,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474062531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:50,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:50,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:56:50,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793237756] [2021-11-07 00:56:50,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:56:50,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:56:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:56:50,910 INFO L87 Difference]: Start difference. First operand 2041 states and 4631 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:54,236 INFO L93 Difference]: Finished difference Result 3193 states and 7252 transitions. [2021-11-07 00:56:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-07 00:56:54,236 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:56:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:54,240 INFO L225 Difference]: With dead ends: 3193 [2021-11-07 00:56:54,240 INFO L226 Difference]: Without dead ends: 3193 [2021-11-07 00:56:54,241 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=354, Invalid=978, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 00:56:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2021-11-07 00:56:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2027. [2021-11-07 00:56:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2017 states have (on average 2.2776400594942983) internal successors, (4594), 2026 states have internal predecessors, (4594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4594 transitions. [2021-11-07 00:56:54,295 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4594 transitions. Word has length 17 [2021-11-07 00:56:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:54,296 INFO L470 AbstractCegarLoop]: Abstraction has 2027 states and 4594 transitions. [2021-11-07 00:56:54,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4594 transitions. [2021-11-07 00:56:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:56:54,299 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:54,299 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:54,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 00:56:54,299 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1727129940, now seen corresponding path program 5 times [2021-11-07 00:56:54,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:54,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944440938] [2021-11-07 00:56:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:54,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:54,910 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:54,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944440938] [2021-11-07 00:56:54,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944440938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:54,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:54,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:56:54,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856601458] [2021-11-07 00:56:54,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:56:54,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:56:54,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:56:54,911 INFO L87 Difference]: Start difference. First operand 2027 states and 4594 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:56:58,795 INFO L93 Difference]: Finished difference Result 3320 states and 7500 transitions. [2021-11-07 00:56:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 00:56:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:56:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:56:58,800 INFO L225 Difference]: With dead ends: 3320 [2021-11-07 00:56:58,800 INFO L226 Difference]: Without dead ends: 3320 [2021-11-07 00:56:58,801 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=398, Invalid=1242, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 00:56:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2021-11-07 00:56:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 2069. [2021-11-07 00:56:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2059 states have (on average 2.2816901408450705) internal successors, (4698), 2068 states have internal predecessors, (4698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 4698 transitions. [2021-11-07 00:56:58,852 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 4698 transitions. Word has length 17 [2021-11-07 00:56:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:56:58,852 INFO L470 AbstractCegarLoop]: Abstraction has 2069 states and 4698 transitions. [2021-11-07 00:56:58,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:56:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 4698 transitions. [2021-11-07 00:56:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:56:58,854 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:56:58,854 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:56:58,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 00:56:58,855 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:56:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:56:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1126402648, now seen corresponding path program 6 times [2021-11-07 00:56:58,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:56:58,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756112011] [2021-11-07 00:56:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:56:58,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:56:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:56:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:56:59,287 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:56:59,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756112011] [2021-11-07 00:56:59,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756112011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:56:59,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:56:59,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:56:59,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250696362] [2021-11-07 00:56:59,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:56:59,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:56:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:56:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:56:59,289 INFO L87 Difference]: Start difference. First operand 2069 states and 4698 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:03,386 INFO L93 Difference]: Finished difference Result 3635 states and 8255 transitions. [2021-11-07 00:57:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-07 00:57:03,386 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:03,390 INFO L225 Difference]: With dead ends: 3635 [2021-11-07 00:57:03,391 INFO L226 Difference]: Without dead ends: 3635 [2021-11-07 00:57:03,391 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=446, Invalid=1194, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 00:57:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2021-11-07 00:57:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 2048. [2021-11-07 00:57:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 2038 states have (on average 2.279685966633955) internal successors, (4646), 2047 states have internal predecessors, (4646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 4646 transitions. [2021-11-07 00:57:03,461 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 4646 transitions. Word has length 17 [2021-11-07 00:57:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:03,462 INFO L470 AbstractCegarLoop]: Abstraction has 2048 states and 4646 transitions. [2021-11-07 00:57:03,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 4646 transitions. [2021-11-07 00:57:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:03,464 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:03,464 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:03,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 00:57:03,464 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 92475378, now seen corresponding path program 7 times [2021-11-07 00:57:03,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:03,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391428641] [2021-11-07 00:57:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:03,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:04,123 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:04,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391428641] [2021-11-07 00:57:04,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391428641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:04,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:04,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:04,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404894783] [2021-11-07 00:57:04,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:04,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:04,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:04,125 INFO L87 Difference]: Start difference. First operand 2048 states and 4646 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:07,498 INFO L93 Difference]: Finished difference Result 3467 states and 7818 transitions. [2021-11-07 00:57:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 00:57:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:07,503 INFO L225 Difference]: With dead ends: 3467 [2021-11-07 00:57:07,503 INFO L226 Difference]: Without dead ends: 3467 [2021-11-07 00:57:07,504 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 00:57:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2021-11-07 00:57:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2091. [2021-11-07 00:57:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2081 states have (on average 2.284959154252763) internal successors, (4755), 2090 states have internal predecessors, (4755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 4755 transitions. [2021-11-07 00:57:07,568 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 4755 transitions. Word has length 17 [2021-11-07 00:57:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:07,568 INFO L470 AbstractCegarLoop]: Abstraction has 2091 states and 4755 transitions. [2021-11-07 00:57:07,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 4755 transitions. [2021-11-07 00:57:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:07,572 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:07,572 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:07,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 00:57:07,573 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1009000662, now seen corresponding path program 8 times [2021-11-07 00:57:07,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:07,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221526879] [2021-11-07 00:57:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:07,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:08,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:08,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221526879] [2021-11-07 00:57:08,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221526879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:08,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:08,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:08,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640149953] [2021-11-07 00:57:08,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:08,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:08,253 INFO L87 Difference]: Start difference. First operand 2091 states and 4755 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:12,047 INFO L93 Difference]: Finished difference Result 3549 states and 8024 transitions. [2021-11-07 00:57:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 00:57:12,048 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:12,065 INFO L225 Difference]: With dead ends: 3549 [2021-11-07 00:57:12,066 INFO L226 Difference]: Without dead ends: 3549 [2021-11-07 00:57:12,067 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 00:57:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2021-11-07 00:57:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 2095. [2021-11-07 00:57:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 2085 states have (on average 2.2863309352517986) internal successors, (4767), 2094 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 4767 transitions. [2021-11-07 00:57:12,099 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 4767 transitions. Word has length 17 [2021-11-07 00:57:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:12,099 INFO L470 AbstractCegarLoop]: Abstraction has 2095 states and 4767 transitions. [2021-11-07 00:57:12,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 4767 transitions. [2021-11-07 00:57:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:12,101 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:12,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:12,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 00:57:12,101 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash 503555842, now seen corresponding path program 9 times [2021-11-07 00:57:12,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:12,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897595524] [2021-11-07 00:57:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:12,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:12,684 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:12,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897595524] [2021-11-07 00:57:12,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897595524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:12,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:12,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:12,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799531359] [2021-11-07 00:57:12,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:12,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:12,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:12,686 INFO L87 Difference]: Start difference. First operand 2095 states and 4767 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:16,681 INFO L93 Difference]: Finished difference Result 3836 states and 8696 transitions. [2021-11-07 00:57:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-07 00:57:16,681 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:16,686 INFO L225 Difference]: With dead ends: 3836 [2021-11-07 00:57:16,686 INFO L226 Difference]: Without dead ends: 3836 [2021-11-07 00:57:16,686 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 00:57:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2021-11-07 00:57:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 2097. [2021-11-07 00:57:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2087 states have (on average 2.2865356971729756) internal successors, (4772), 2096 states have internal predecessors, (4772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 4772 transitions. [2021-11-07 00:57:16,721 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 4772 transitions. Word has length 17 [2021-11-07 00:57:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:16,722 INFO L470 AbstractCegarLoop]: Abstraction has 2097 states and 4772 transitions. [2021-11-07 00:57:16,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 4772 transitions. [2021-11-07 00:57:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:16,723 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:16,723 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:16,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 00:57:16,723 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:16,723 INFO L85 PathProgramCache]: Analyzing trace with hash -97171450, now seen corresponding path program 10 times [2021-11-07 00:57:16,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:16,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215678285] [2021-11-07 00:57:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:16,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:17,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:17,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215678285] [2021-11-07 00:57:17,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215678285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:17,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:17,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:57:17,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456528893] [2021-11-07 00:57:17,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:57:17,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:17,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:57:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:57:17,109 INFO L87 Difference]: Start difference. First operand 2097 states and 4772 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:20,936 INFO L93 Difference]: Finished difference Result 3880 states and 8801 transitions. [2021-11-07 00:57:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-07 00:57:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:20,942 INFO L225 Difference]: With dead ends: 3880 [2021-11-07 00:57:20,942 INFO L226 Difference]: Without dead ends: 3880 [2021-11-07 00:57:20,942 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 00:57:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2021-11-07 00:57:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 2055. [2021-11-07 00:57:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2045 states have (on average 2.282640586797066) internal successors, (4668), 2054 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4668 transitions. [2021-11-07 00:57:20,984 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4668 transitions. Word has length 17 [2021-11-07 00:57:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:20,984 INFO L470 AbstractCegarLoop]: Abstraction has 2055 states and 4668 transitions. [2021-11-07 00:57:20,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4668 transitions. [2021-11-07 00:57:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:20,986 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:20,987 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:20,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 00:57:20,987 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1374641156, now seen corresponding path program 11 times [2021-11-07 00:57:20,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:20,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961927867] [2021-11-07 00:57:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:20,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:21,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:21,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961927867] [2021-11-07 00:57:21,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961927867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:21,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:21,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:21,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713097094] [2021-11-07 00:57:21,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:21,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:21,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:21,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:21,663 INFO L87 Difference]: Start difference. First operand 2055 states and 4668 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:24,385 INFO L93 Difference]: Finished difference Result 3522 states and 7926 transitions. [2021-11-07 00:57:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 00:57:24,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:24,389 INFO L225 Difference]: With dead ends: 3522 [2021-11-07 00:57:24,389 INFO L226 Difference]: Without dead ends: 3522 [2021-11-07 00:57:24,390 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2021-11-07 00:57:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2021-11-07 00:57:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 2096. [2021-11-07 00:57:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 2086 states have (on average 2.286673058485139) internal successors, (4770), 2095 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 4770 transitions. [2021-11-07 00:57:24,435 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 4770 transitions. Word has length 17 [2021-11-07 00:57:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:24,435 INFO L470 AbstractCegarLoop]: Abstraction has 2096 states and 4770 transitions. [2021-11-07 00:57:24,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 4770 transitions. [2021-11-07 00:57:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:24,436 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:24,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:24,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 00:57:24,436 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 273165116, now seen corresponding path program 12 times [2021-11-07 00:57:24,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:24,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320396360] [2021-11-07 00:57:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:24,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:25,068 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:25,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320396360] [2021-11-07 00:57:25,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320396360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:25,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:25,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:25,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157483330] [2021-11-07 00:57:25,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:25,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:25,070 INFO L87 Difference]: Start difference. First operand 2096 states and 4770 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:27,914 INFO L93 Difference]: Finished difference Result 3473 states and 7838 transitions. [2021-11-07 00:57:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 00:57:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:27,926 INFO L225 Difference]: With dead ends: 3473 [2021-11-07 00:57:27,927 INFO L226 Difference]: Without dead ends: 3473 [2021-11-07 00:57:27,927 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2021-11-07 00:57:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2021-11-07 00:57:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 2096. [2021-11-07 00:57:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 2086 states have (on average 2.286673058485139) internal successors, (4770), 2095 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 4770 transitions. [2021-11-07 00:57:27,958 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 4770 transitions. Word has length 17 [2021-11-07 00:57:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:27,958 INFO L470 AbstractCegarLoop]: Abstraction has 2096 states and 4770 transitions. [2021-11-07 00:57:27,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 4770 transitions. [2021-11-07 00:57:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:27,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:27,960 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:27,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 00:57:27,960 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1785721620, now seen corresponding path program 13 times [2021-11-07 00:57:27,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:27,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658509308] [2021-11-07 00:57:27,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:27,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:28,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:28,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658509308] [2021-11-07 00:57:28,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658509308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:28,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:28,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:28,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306668258] [2021-11-07 00:57:28,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:28,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:28,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:28,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:28,547 INFO L87 Difference]: Start difference. First operand 2096 states and 4770 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:31,661 INFO L93 Difference]: Finished difference Result 3621 states and 8220 transitions. [2021-11-07 00:57:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 00:57:31,661 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:31,665 INFO L225 Difference]: With dead ends: 3621 [2021-11-07 00:57:31,666 INFO L226 Difference]: Without dead ends: 3621 [2021-11-07 00:57:31,666 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 00:57:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2021-11-07 00:57:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 2068. [2021-11-07 00:57:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 2058 states have (on average 2.2857142857142856) internal successors, (4704), 2067 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 4704 transitions. [2021-11-07 00:57:31,701 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 4704 transitions. Word has length 17 [2021-11-07 00:57:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:31,701 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 4704 transitions. [2021-11-07 00:57:31,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 4704 transitions. [2021-11-07 00:57:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 00:57:31,702 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:31,702 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:31,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 00:57:31,702 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1184994328, now seen corresponding path program 14 times [2021-11-07 00:57:31,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:31,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037875685] [2021-11-07 00:57:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:31,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:32,166 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:32,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037875685] [2021-11-07 00:57:32,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037875685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:32,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:32,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:57:32,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591052379] [2021-11-07 00:57:32,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:57:32,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:32,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:57:32,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:57:32,167 INFO L87 Difference]: Start difference. First operand 2068 states and 4704 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:35,555 INFO L93 Difference]: Finished difference Result 3626 states and 8239 transitions. [2021-11-07 00:57:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 00:57:35,556 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 00:57:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:35,560 INFO L225 Difference]: With dead ends: 3626 [2021-11-07 00:57:35,560 INFO L226 Difference]: Without dead ends: 3626 [2021-11-07 00:57:35,560 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=319, Invalid=803, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 00:57:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2021-11-07 00:57:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 1991. [2021-11-07 00:57:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1981 states have (on average 2.2776375567895) internal successors, (4512), 1990 states have internal predecessors, (4512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4512 transitions. [2021-11-07 00:57:35,593 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4512 transitions. Word has length 17 [2021-11-07 00:57:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:35,593 INFO L470 AbstractCegarLoop]: Abstraction has 1991 states and 4512 transitions. [2021-11-07 00:57:35,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4512 transitions. [2021-11-07 00:57:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:57:35,595 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:35,595 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:35,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 00:57:35,595 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:35,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1907177992, now seen corresponding path program 1 times [2021-11-07 00:57:35,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:35,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415030272] [2021-11-07 00:57:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:35,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:36,136 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:36,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415030272] [2021-11-07 00:57:36,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415030272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:36,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:36,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:36,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656049745] [2021-11-07 00:57:36,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:36,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:36,138 INFO L87 Difference]: Start difference. First operand 1991 states and 4512 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:39,796 INFO L93 Difference]: Finished difference Result 2658 states and 5950 transitions. [2021-11-07 00:57:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 00:57:39,797 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:57:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:39,801 INFO L225 Difference]: With dead ends: 2658 [2021-11-07 00:57:39,801 INFO L226 Difference]: Without dead ends: 2658 [2021-11-07 00:57:39,802 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2021-11-07 00:57:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-11-07 00:57:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2023. [2021-11-07 00:57:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 2013 states have (on average 2.278688524590164) internal successors, (4587), 2022 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 4587 transitions. [2021-11-07 00:57:39,832 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 4587 transitions. Word has length 18 [2021-11-07 00:57:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:39,832 INFO L470 AbstractCegarLoop]: Abstraction has 2023 states and 4587 transitions. [2021-11-07 00:57:39,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 4587 transitions. [2021-11-07 00:57:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:57:39,833 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:39,833 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:39,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 00:57:39,833 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:39,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:39,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1917499132, now seen corresponding path program 2 times [2021-11-07 00:57:39,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:39,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867399029] [2021-11-07 00:57:39,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:39,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:40,353 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:40,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867399029] [2021-11-07 00:57:40,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867399029] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:40,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:40,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:40,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899688397] [2021-11-07 00:57:40,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:40,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:40,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:40,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:40,354 INFO L87 Difference]: Start difference. First operand 2023 states and 4587 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:43,895 INFO L93 Difference]: Finished difference Result 2718 states and 6082 transitions. [2021-11-07 00:57:43,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:57:43,895 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:57:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:43,898 INFO L225 Difference]: With dead ends: 2718 [2021-11-07 00:57:43,898 INFO L226 Difference]: Without dead ends: 2718 [2021-11-07 00:57:43,899 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2021-11-07 00:57:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2021-11-07 00:57:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2025. [2021-11-07 00:57:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 2015 states have (on average 2.2794044665012407) internal successors, (4593), 2024 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 4593 transitions. [2021-11-07 00:57:43,927 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 4593 transitions. Word has length 18 [2021-11-07 00:57:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:43,927 INFO L470 AbstractCegarLoop]: Abstraction has 2025 states and 4593 transitions. [2021-11-07 00:57:43,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 4593 transitions. [2021-11-07 00:57:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:57:43,928 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:43,928 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:43,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 00:57:43,928 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2075387424, now seen corresponding path program 3 times [2021-11-07 00:57:43,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:43,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889211227] [2021-11-07 00:57:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:43,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:44,176 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:44,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889211227] [2021-11-07 00:57:44,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889211227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:44,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:44,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:57:44,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916009104] [2021-11-07 00:57:44,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:57:44,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:57:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:57:44,178 INFO L87 Difference]: Start difference. First operand 2025 states and 4593 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:47,661 INFO L93 Difference]: Finished difference Result 2849 states and 6363 transitions. [2021-11-07 00:57:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-07 00:57:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:57:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:47,677 INFO L225 Difference]: With dead ends: 2849 [2021-11-07 00:57:47,677 INFO L226 Difference]: Without dead ends: 2849 [2021-11-07 00:57:47,678 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=688, Invalid=1664, Unknown=0, NotChecked=0, Total=2352 [2021-11-07 00:57:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2021-11-07 00:57:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2027. [2021-11-07 00:57:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2017 states have (on average 2.278135845314824) internal successors, (4595), 2026 states have internal predecessors, (4595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4595 transitions. [2021-11-07 00:57:47,721 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4595 transitions. Word has length 18 [2021-11-07 00:57:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:47,722 INFO L470 AbstractCegarLoop]: Abstraction has 2027 states and 4595 transitions. [2021-11-07 00:57:47,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4595 transitions. [2021-11-07 00:57:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:57:47,723 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:47,723 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:47,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 00:57:47,724 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -928803984, now seen corresponding path program 4 times [2021-11-07 00:57:47,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:47,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033504290] [2021-11-07 00:57:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:47,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:48,171 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:48,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033504290] [2021-11-07 00:57:48,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033504290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:48,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:48,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:48,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751099113] [2021-11-07 00:57:48,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:48,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:48,173 INFO L87 Difference]: Start difference. First operand 2027 states and 4595 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:52,238 INFO L93 Difference]: Finished difference Result 2699 states and 6040 transitions. [2021-11-07 00:57:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:57:52,238 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:57:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:52,241 INFO L225 Difference]: With dead ends: 2699 [2021-11-07 00:57:52,241 INFO L226 Difference]: Without dead ends: 2699 [2021-11-07 00:57:52,242 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2021-11-07 00:57:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2021-11-07 00:57:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2038. [2021-11-07 00:57:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 2028 states have (on average 2.2785996055226825) internal successors, (4621), 2037 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 4621 transitions. [2021-11-07 00:57:52,270 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 4621 transitions. Word has length 18 [2021-11-07 00:57:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:52,270 INFO L470 AbstractCegarLoop]: Abstraction has 2038 states and 4621 transitions. [2021-11-07 00:57:52,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 4621 transitions. [2021-11-07 00:57:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:57:52,271 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:52,272 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:52,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-07 00:57:52,272 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash -939125124, now seen corresponding path program 5 times [2021-11-07 00:57:52,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:52,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924867446] [2021-11-07 00:57:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:52,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:52,847 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:52,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924867446] [2021-11-07 00:57:52,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924867446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:52,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:52,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:52,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203938609] [2021-11-07 00:57:52,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:52,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:52,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:52,849 INFO L87 Difference]: Start difference. First operand 2038 states and 4621 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:56,449 INFO L93 Difference]: Finished difference Result 2735 states and 6121 transitions. [2021-11-07 00:57:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:57:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:57:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:56,452 INFO L225 Difference]: With dead ends: 2735 [2021-11-07 00:57:56,453 INFO L226 Difference]: Without dead ends: 2735 [2021-11-07 00:57:56,453 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2021-11-07 00:57:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2021-11-07 00:57:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2040. [2021-11-07 00:57:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2030 states have (on average 2.279310344827586) internal successors, (4627), 2039 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 4627 transitions. [2021-11-07 00:57:56,507 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 4627 transitions. Word has length 18 [2021-11-07 00:57:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:56,508 INFO L470 AbstractCegarLoop]: Abstraction has 2040 states and 4627 transitions. [2021-11-07 00:57:56,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:57:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 4627 transitions. [2021-11-07 00:57:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:57:56,510 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:56,510 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:56,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-07 00:57:56,510 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:57:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1510480748, now seen corresponding path program 6 times [2021-11-07 00:57:56,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:56,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833846269] [2021-11-07 00:57:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:56,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:56,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:56,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833846269] [2021-11-07 00:57:56,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833846269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:56,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:56,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:57:56,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171506169] [2021-11-07 00:57:56,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:57:56,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:56,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:57:56,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:57:56,949 INFO L87 Difference]: Start difference. First operand 2040 states and 4627 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:00,377 INFO L93 Difference]: Finished difference Result 2721 states and 6094 transitions. [2021-11-07 00:58:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 00:58:00,377 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:00,380 INFO L225 Difference]: With dead ends: 2721 [2021-11-07 00:58:00,380 INFO L226 Difference]: Without dead ends: 2721 [2021-11-07 00:58:00,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2021-11-07 00:58:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2021-11-07 00:58:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2047. [2021-11-07 00:58:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2037 states have (on average 2.2793323514973) internal successors, (4643), 2046 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 4643 transitions. [2021-11-07 00:58:00,413 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 4643 transitions. Word has length 18 [2021-11-07 00:58:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:00,414 INFO L470 AbstractCegarLoop]: Abstraction has 2047 states and 4643 transitions. [2021-11-07 00:58:00,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 4643 transitions. [2021-11-07 00:58:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:00,415 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:00,416 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:00,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-07 00:58:00,416 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1500159608, now seen corresponding path program 7 times [2021-11-07 00:58:00,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:00,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989551087] [2021-11-07 00:58:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:00,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:00,980 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:00,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989551087] [2021-11-07 00:58:00,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989551087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:00,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:00,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:58:00,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791565811] [2021-11-07 00:58:00,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:58:00,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:00,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:58:00,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:58:00,982 INFO L87 Difference]: Start difference. First operand 2047 states and 4643 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:05,562 INFO L93 Difference]: Finished difference Result 2777 states and 6211 transitions. [2021-11-07 00:58:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 00:58:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:05,566 INFO L225 Difference]: With dead ends: 2777 [2021-11-07 00:58:05,566 INFO L226 Difference]: Without dead ends: 2777 [2021-11-07 00:58:05,567 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 00:58:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2021-11-07 00:58:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2046. [2021-11-07 00:58:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2036 states have (on average 2.2789783889980355) internal successors, (4640), 2045 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4640 transitions. [2021-11-07 00:58:05,614 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4640 transitions. Word has length 18 [2021-11-07 00:58:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:05,614 INFO L470 AbstractCegarLoop]: Abstraction has 2046 states and 4640 transitions. [2021-11-07 00:58:05,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4640 transitions. [2021-11-07 00:58:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:05,616 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:05,616 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:05,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-07 00:58:05,616 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:05,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1198078868, now seen corresponding path program 8 times [2021-11-07 00:58:05,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:05,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446174475] [2021-11-07 00:58:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:05,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:05,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:05,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446174475] [2021-11-07 00:58:05,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446174475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:05,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:05,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:58:05,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467609668] [2021-11-07 00:58:05,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:58:05,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:58:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:58:05,943 INFO L87 Difference]: Start difference. First operand 2046 states and 4640 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:09,095 INFO L93 Difference]: Finished difference Result 2781 states and 6219 transitions. [2021-11-07 00:58:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-07 00:58:09,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:09,098 INFO L225 Difference]: With dead ends: 2781 [2021-11-07 00:58:09,098 INFO L226 Difference]: Without dead ends: 2781 [2021-11-07 00:58:09,099 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=540, Invalid=1352, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 00:58:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2021-11-07 00:58:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2037. [2021-11-07 00:58:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2027 states have (on average 2.2782437099161323) internal successors, (4618), 2036 states have internal predecessors, (4618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 4618 transitions. [2021-11-07 00:58:09,138 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 4618 transitions. Word has length 18 [2021-11-07 00:58:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:09,138 INFO L470 AbstractCegarLoop]: Abstraction has 2037 states and 4618 transitions. [2021-11-07 00:58:09,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 4618 transitions. [2021-11-07 00:58:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:09,140 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:09,140 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:09,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-07 00:58:09,141 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash 289104324, now seen corresponding path program 9 times [2021-11-07 00:58:09,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:09,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532344237] [2021-11-07 00:58:09,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:09,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:09,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:09,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532344237] [2021-11-07 00:58:09,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532344237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:09,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:09,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:58:09,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691958194] [2021-11-07 00:58:09,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:58:09,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:58:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:58:09,441 INFO L87 Difference]: Start difference. First operand 2037 states and 4618 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:12,304 INFO L93 Difference]: Finished difference Result 2790 states and 6237 transitions. [2021-11-07 00:58:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-07 00:58:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:12,308 INFO L225 Difference]: With dead ends: 2790 [2021-11-07 00:58:12,308 INFO L226 Difference]: Without dead ends: 2790 [2021-11-07 00:58:12,308 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 00:58:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2021-11-07 00:58:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2060. [2021-11-07 00:58:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2050 states have (on average 2.279512195121951) internal successors, (4673), 2059 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 4673 transitions. [2021-11-07 00:58:12,340 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 4673 transitions. Word has length 18 [2021-11-07 00:58:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:12,341 INFO L470 AbstractCegarLoop]: Abstraction has 2060 states and 4673 transitions. [2021-11-07 00:58:12,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 4673 transitions. [2021-11-07 00:58:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:12,342 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:12,342 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:12,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-07 00:58:12,342 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 696473118, now seen corresponding path program 10 times [2021-11-07 00:58:12,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:12,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005051178] [2021-11-07 00:58:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:12,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:12,649 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:12,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005051178] [2021-11-07 00:58:12,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005051178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:12,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:12,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:58:12,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596062867] [2021-11-07 00:58:12,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:58:12,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:12,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:58:12,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:58:12,650 INFO L87 Difference]: Start difference. First operand 2060 states and 4673 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:15,671 INFO L93 Difference]: Finished difference Result 2715 states and 6084 transitions. [2021-11-07 00:58:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-07 00:58:15,671 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:15,674 INFO L225 Difference]: With dead ends: 2715 [2021-11-07 00:58:15,674 INFO L226 Difference]: Without dead ends: 2715 [2021-11-07 00:58:15,675 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=420, Invalid=1472, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 00:58:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2021-11-07 00:58:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2068. [2021-11-07 00:58:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 2058 states have (on average 2.2793974732750244) internal successors, (4691), 2067 states have internal predecessors, (4691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 4691 transitions. [2021-11-07 00:58:15,706 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 4691 transitions. Word has length 18 [2021-11-07 00:58:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:15,706 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 4691 transitions. [2021-11-07 00:58:15,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 4691 transitions. [2021-11-07 00:58:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:15,707 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:15,707 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:15,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-07 00:58:15,707 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1386679018, now seen corresponding path program 11 times [2021-11-07 00:58:15,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:15,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366122358] [2021-11-07 00:58:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:15,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:16,063 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:16,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366122358] [2021-11-07 00:58:16,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366122358] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:16,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:16,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:58:16,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182038330] [2021-11-07 00:58:16,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:58:16,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:58:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:58:16,065 INFO L87 Difference]: Start difference. First operand 2068 states and 4691 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:18,337 INFO L93 Difference]: Finished difference Result 2653 states and 5956 transitions. [2021-11-07 00:58:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-07 00:58:18,337 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:18,340 INFO L225 Difference]: With dead ends: 2653 [2021-11-07 00:58:18,340 INFO L226 Difference]: Without dead ends: 2653 [2021-11-07 00:58:18,341 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=1218, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 00:58:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2021-11-07 00:58:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2073. [2021-11-07 00:58:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2063 states have (on average 2.279689772176442) internal successors, (4703), 2072 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 4703 transitions. [2021-11-07 00:58:18,369 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 4703 transitions. Word has length 18 [2021-11-07 00:58:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:18,369 INFO L470 AbstractCegarLoop]: Abstraction has 2073 states and 4703 transitions. [2021-11-07 00:58:18,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 4703 transitions. [2021-11-07 00:58:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:18,370 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:18,371 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:18,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-07 00:58:18,371 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1410311002, now seen corresponding path program 12 times [2021-11-07 00:58:18,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:18,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342673835] [2021-11-07 00:58:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:18,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:18,720 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:18,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342673835] [2021-11-07 00:58:18,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342673835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:18,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:18,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:58:18,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840146354] [2021-11-07 00:58:18,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:58:18,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:58:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:58:18,721 INFO L87 Difference]: Start difference. First operand 2073 states and 4703 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:21,848 INFO L93 Difference]: Finished difference Result 2874 states and 6438 transitions. [2021-11-07 00:58:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 00:58:21,849 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:21,852 INFO L225 Difference]: With dead ends: 2874 [2021-11-07 00:58:21,852 INFO L226 Difference]: Without dead ends: 2874 [2021-11-07 00:58:21,853 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=411, Invalid=1481, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 00:58:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2021-11-07 00:58:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2028. [2021-11-07 00:58:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 2018 states have (on average 2.278493557978196) internal successors, (4598), 2027 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 4598 transitions. [2021-11-07 00:58:21,887 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 4598 transitions. Word has length 18 [2021-11-07 00:58:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:21,888 INFO L470 AbstractCegarLoop]: Abstraction has 2028 states and 4598 transitions. [2021-11-07 00:58:21,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 4598 transitions. [2021-11-07 00:58:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:58:21,890 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:21,890 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:21,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-07 00:58:21,890 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash 204772406, now seen corresponding path program 1 times [2021-11-07 00:58:21,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:21,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525650207] [2021-11-07 00:58:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:21,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:22,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:22,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525650207] [2021-11-07 00:58:22,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525650207] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:22,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:22,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:22,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731492132] [2021-11-07 00:58:22,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 00:58:22,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:22,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 00:58:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-07 00:58:22,133 INFO L87 Difference]: Start difference. First operand 2028 states and 4598 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:23,052 INFO L93 Difference]: Finished difference Result 1973 states and 4469 transitions. [2021-11-07 00:58:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 00:58:23,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 00:58:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:23,058 INFO L225 Difference]: With dead ends: 1973 [2021-11-07 00:58:23,058 INFO L226 Difference]: Without dead ends: 1963 [2021-11-07 00:58:23,058 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:58:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2021-11-07 00:58:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1954. [2021-11-07 00:58:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1944 states have (on average 2.27880658436214) internal successors, (4430), 1953 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 4430 transitions. [2021-11-07 00:58:23,092 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 4430 transitions. Word has length 18 [2021-11-07 00:58:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:23,092 INFO L470 AbstractCegarLoop]: Abstraction has 1954 states and 4430 transitions. [2021-11-07 00:58:23,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 4430 transitions. [2021-11-07 00:58:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 00:58:23,094 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:23,094 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:23,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-07 00:58:23,095 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:58:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -976023985, now seen corresponding path program 1 times [2021-11-07 00:58:23,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:23,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025041489] [2021-11-07 00:58:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:23,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:23,641 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:23,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025041489] [2021-11-07 00:58:23,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025041489] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:23,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838135496] [2021-11-07 00:58:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:23,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:23,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:23,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:23,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 00:58:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:23,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 92 conjunts are in the unsatisfiable core [2021-11-07 00:58:23,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:24,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:24,437 INFO L354 Elim1Store]: treesize reduction 560, result has 7.0 percent of original size [2021-11-07 00:58:24,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 277 treesize of output 205 [2021-11-07 00:58:24,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:24,632 INFO L354 Elim1Store]: treesize reduction 754, result has 7.1 percent of original size [2021-11-07 00:58:24,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 270 treesize of output 166 [2021-11-07 00:58:24,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 303 [2021-11-07 00:58:26,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:26,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 00:58:26,287 INFO L354 Elim1Store]: treesize reduction 468, result has 14.1 percent of original size [2021-11-07 00:58:26,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 246 treesize of output 204 [2021-11-07 00:58:26,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:26,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 00:58:26,391 INFO L354 Elim1Store]: treesize reduction 284, result has 17.9 percent of original size [2021-11-07 00:58:26,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 217 treesize of output 184 [2021-11-07 00:58:27,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:27,108 INFO L354 Elim1Store]: treesize reduction 306, result has 11.8 percent of original size [2021-11-07 00:58:27,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 297 treesize of output 201 [2021-11-07 00:58:27,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:27,198 INFO L354 Elim1Store]: treesize reduction 325, result has 11.7 percent of original size [2021-11-07 00:58:27,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 274 treesize of output 207 [2021-11-07 00:58:27,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:27,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 00:58:27,405 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 00:58:27,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 57 [2021-11-07 00:58:28,657 INFO L354 Elim1Store]: treesize reduction 59, result has 14.5 percent of original size [2021-11-07 00:58:28,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 36 [2021-11-07 00:58:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:28,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:31,008 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 00:58:31,009 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-11-07 00:58:31,013 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 00:58:31,014 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-11-07 00:59:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:07,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838135496] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:59:07,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273756900] [2021-11-07 00:59:07,985 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:59:07,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:59:07,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2021-11-07 00:59:07,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27280802] [2021-11-07 00:59:07,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-07 00:59:07,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-07 00:59:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1291, Unknown=16, NotChecked=0, Total=1482 [2021-11-07 00:59:07,988 INFO L87 Difference]: Start difference. First operand 1954 states and 4430 transitions. Second operand has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:29,346 INFO L93 Difference]: Finished difference Result 2949 states and 6621 transitions. [2021-11-07 00:59:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-07 00:59:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 19 [2021-11-07 00:59:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:29,352 INFO L225 Difference]: With dead ends: 2949 [2021-11-07 00:59:29,352 INFO L226 Difference]: Without dead ends: 2949 [2021-11-07 00:59:29,353 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=1388, Invalid=6428, Unknown=16, NotChecked=0, Total=7832 [2021-11-07 00:59:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2021-11-07 00:59:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2103. [2021-11-07 00:59:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2093 states have (on average 2.2732919254658386) internal successors, (4758), 2102 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 4758 transitions. [2021-11-07 00:59:29,388 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 4758 transitions. Word has length 19 [2021-11-07 00:59:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:29,389 INFO L470 AbstractCegarLoop]: Abstraction has 2103 states and 4758 transitions. [2021-11-07 00:59:29,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 4758 transitions. [2021-11-07 00:59:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:29,390 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:29,390 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:29,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-07 00:59:29,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:59:29,591 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:29,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1152093850, now seen corresponding path program 1 times [2021-11-07 00:59:29,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:29,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170523003] [2021-11-07 00:59:29,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:29,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:30,154 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:30,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170523003] [2021-11-07 00:59:30,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170523003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:30,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:30,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:59:30,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366356387] [2021-11-07 00:59:30,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:59:30,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:59:30,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:59:30,156 INFO L87 Difference]: Start difference. First operand 2103 states and 4758 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:34,760 INFO L93 Difference]: Finished difference Result 3470 states and 7824 transitions. [2021-11-07 00:59:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-07 00:59:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 00:59:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:34,768 INFO L225 Difference]: With dead ends: 3470 [2021-11-07 00:59:34,768 INFO L226 Difference]: Without dead ends: 3470 [2021-11-07 00:59:34,768 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=581, Invalid=1489, Unknown=0, NotChecked=0, Total=2070 [2021-11-07 00:59:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2021-11-07 00:59:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 2226. [2021-11-07 00:59:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2216 states have (on average 2.292870036101083) internal successors, (5081), 2225 states have internal predecessors, (5081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 5081 transitions. [2021-11-07 00:59:34,830 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 5081 transitions. Word has length 20 [2021-11-07 00:59:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:34,830 INFO L470 AbstractCegarLoop]: Abstraction has 2226 states and 5081 transitions. [2021-11-07 00:59:34,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 5081 transitions. [2021-11-07 00:59:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:34,833 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:34,833 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:34,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-07 00:59:34,834 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -962177770, now seen corresponding path program 2 times [2021-11-07 00:59:34,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:34,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212917639] [2021-11-07 00:59:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:34,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:35,447 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:35,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212917639] [2021-11-07 00:59:35,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212917639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:35,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:35,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 00:59:35,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019143914] [2021-11-07 00:59:35,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 00:59:35,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 00:59:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:59:35,449 INFO L87 Difference]: Start difference. First operand 2226 states and 5081 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:39,784 INFO L93 Difference]: Finished difference Result 3537 states and 8028 transitions. [2021-11-07 00:59:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 00:59:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 00:59:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:39,791 INFO L225 Difference]: With dead ends: 3537 [2021-11-07 00:59:39,791 INFO L226 Difference]: Without dead ends: 3537 [2021-11-07 00:59:39,791 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2021-11-07 00:59:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2021-11-07 00:59:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 2417. [2021-11-07 00:59:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2407 states have (on average 2.2908184461985877) internal successors, (5514), 2416 states have internal predecessors, (5514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 5514 transitions. [2021-11-07 00:59:39,847 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 5514 transitions. Word has length 20 [2021-11-07 00:59:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:39,848 INFO L470 AbstractCegarLoop]: Abstraction has 2417 states and 5514 transitions. [2021-11-07 00:59:39,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 5514 transitions. [2021-11-07 00:59:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:39,850 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:39,851 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:39,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-07 00:59:39,851 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -557003234, now seen corresponding path program 3 times [2021-11-07 00:59:39,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:39,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91639814] [2021-11-07 00:59:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:39,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:40,574 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:40,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91639814] [2021-11-07 00:59:40,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91639814] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:40,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:40,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 00:59:40,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231257238] [2021-11-07 00:59:40,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:59:40,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:59:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:59:40,575 INFO L87 Difference]: Start difference. First operand 2417 states and 5514 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:43,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:43,497 INFO L93 Difference]: Finished difference Result 2673 states and 6052 transitions. [2021-11-07 00:59:43,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 00:59:43,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 00:59:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:43,502 INFO L225 Difference]: With dead ends: 2673 [2021-11-07 00:59:43,502 INFO L226 Difference]: Without dead ends: 2673 [2021-11-07 00:59:43,502 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2021-11-07 00:59:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2021-11-07 00:59:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2427. [2021-11-07 00:59:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2417 states have (on average 2.2900289615225486) internal successors, (5535), 2426 states have internal predecessors, (5535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5535 transitions. [2021-11-07 00:59:43,552 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5535 transitions. Word has length 20 [2021-11-07 00:59:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:43,553 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 5535 transitions. [2021-11-07 00:59:43,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5535 transitions. [2021-11-07 00:59:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:43,555 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:43,555 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:43,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-07 00:59:43,556 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1456519398, now seen corresponding path program 4 times [2021-11-07 00:59:43,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:43,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706067215] [2021-11-07 00:59:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:43,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:44,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:44,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706067215] [2021-11-07 00:59:44,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706067215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:44,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:44,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 00:59:44,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938904124] [2021-11-07 00:59:44,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 00:59:44,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 00:59:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:59:44,136 INFO L87 Difference]: Start difference. First operand 2427 states and 5535 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:48,391 INFO L93 Difference]: Finished difference Result 3368 states and 7637 transitions. [2021-11-07 00:59:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-07 00:59:48,392 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 00:59:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:48,399 INFO L225 Difference]: With dead ends: 3368 [2021-11-07 00:59:48,399 INFO L226 Difference]: Without dead ends: 3368 [2021-11-07 00:59:48,399 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=383, Invalid=1023, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 00:59:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2021-11-07 00:59:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 2420. [2021-11-07 00:59:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2410 states have (on average 2.2904564315352696) internal successors, (5520), 2419 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 5520 transitions. [2021-11-07 00:59:48,463 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 5520 transitions. Word has length 20 [2021-11-07 00:59:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:48,464 INFO L470 AbstractCegarLoop]: Abstraction has 2420 states and 5520 transitions. [2021-11-07 00:59:48,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 5520 transitions. [2021-11-07 00:59:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:48,466 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:48,467 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:48,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-07 00:59:48,467 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1344510106, now seen corresponding path program 5 times [2021-11-07 00:59:48,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:48,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33853578] [2021-11-07 00:59:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:48,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:49,024 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:49,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33853578] [2021-11-07 00:59:49,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33853578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:49,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:49,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 00:59:49,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126446030] [2021-11-07 00:59:49,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 00:59:49,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 00:59:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-07 00:59:49,026 INFO L87 Difference]: Start difference. First operand 2420 states and 5520 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:52,226 INFO L93 Difference]: Finished difference Result 3404 states and 7719 transitions. [2021-11-07 00:59:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 00:59:52,227 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 00:59:52,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:52,232 INFO L225 Difference]: With dead ends: 3404 [2021-11-07 00:59:52,232 INFO L226 Difference]: Without dead ends: 3404 [2021-11-07 00:59:52,233 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=348, Invalid=842, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 00:59:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2021-11-07 00:59:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 2463. [2021-11-07 00:59:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 2453 states have (on average 2.291479820627803) internal successors, (5621), 2462 states have internal predecessors, (5621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5621 transitions. [2021-11-07 00:59:52,282 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5621 transitions. Word has length 20 [2021-11-07 00:59:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:52,311 INFO L470 AbstractCegarLoop]: Abstraction has 2463 states and 5621 transitions. [2021-11-07 00:59:52,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5621 transitions. [2021-11-07 00:59:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:52,313 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:52,313 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:52,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-07 00:59:52,313 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash -705123008, now seen corresponding path program 6 times [2021-11-07 00:59:52,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:52,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342002447] [2021-11-07 00:59:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:52,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:52,689 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:52,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342002447] [2021-11-07 00:59:52,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342002447] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:52,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:52,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 00:59:52,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841339033] [2021-11-07 00:59:52,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:52,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:52,690 INFO L87 Difference]: Start difference. First operand 2463 states and 5621 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:54,115 INFO L93 Difference]: Finished difference Result 2535 states and 5769 transitions. [2021-11-07 00:59:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 00:59:54,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 00:59:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:54,119 INFO L225 Difference]: With dead ends: 2535 [2021-11-07 00:59:54,119 INFO L226 Difference]: Without dead ends: 2535 [2021-11-07 00:59:54,119 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:59:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2021-11-07 00:59:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2477. [2021-11-07 00:59:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2467 states have (on average 2.2894203486015403) internal successors, (5648), 2476 states have internal predecessors, (5648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 5648 transitions. [2021-11-07 00:59:54,162 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 5648 transitions. Word has length 20 [2021-11-07 00:59:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:54,162 INFO L470 AbstractCegarLoop]: Abstraction has 2477 states and 5648 transitions. [2021-11-07 00:59:54,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 5648 transitions. [2021-11-07 00:59:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:54,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:54,164 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:54,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-07 00:59:54,164 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 554071014, now seen corresponding path program 7 times [2021-11-07 00:59:54,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:54,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994264096] [2021-11-07 00:59:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:54,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:54,706 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:54,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994264096] [2021-11-07 00:59:54,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994264096] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:54,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:54,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 00:59:54,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884931505] [2021-11-07 00:59:54,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 00:59:54,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 00:59:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:59:54,707 INFO L87 Difference]: Start difference. First operand 2477 states and 5648 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:59,454 INFO L93 Difference]: Finished difference Result 3360 states and 7634 transitions. [2021-11-07 00:59:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-07 00:59:59,454 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 00:59:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:59,459 INFO L225 Difference]: With dead ends: 3360 [2021-11-07 00:59:59,459 INFO L226 Difference]: Without dead ends: 3360 [2021-11-07 00:59:59,459 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=399, Invalid=1493, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 00:59:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2021-11-07 00:59:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2483. [2021-11-07 00:59:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2473 states have (on average 2.2895268904164983) internal successors, (5662), 2482 states have internal predecessors, (5662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 5662 transitions. [2021-11-07 00:59:59,500 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 5662 transitions. Word has length 20 [2021-11-07 00:59:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:59,501 INFO L470 AbstractCegarLoop]: Abstraction has 2483 states and 5662 transitions. [2021-11-07 00:59:59,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 5662 transitions. [2021-11-07 00:59:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 00:59:59,502 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:59,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:59,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-07 00:59:59,503 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 00:59:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1159565768, now seen corresponding path program 8 times [2021-11-07 00:59:59,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:59,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733372587] [2021-11-07 00:59:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:59,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:59,884 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:59,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733372587] [2021-11-07 00:59:59,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733372587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:59,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:59,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 00:59:59,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898668798] [2021-11-07 00:59:59,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:59,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:59,886 INFO L87 Difference]: Start difference. First operand 2483 states and 5662 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:01,703 INFO L93 Difference]: Finished difference Result 2493 states and 5682 transitions. [2021-11-07 01:00:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:00:01,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 01:00:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:01,707 INFO L225 Difference]: With dead ends: 2493 [2021-11-07 01:00:01,707 INFO L226 Difference]: Without dead ends: 2493 [2021-11-07 01:00:01,708 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:00:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2021-11-07 01:00:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2485. [2021-11-07 01:00:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2475 states have (on average 2.2892929292929294) internal successors, (5666), 2484 states have internal predecessors, (5666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 5666 transitions. [2021-11-07 01:00:01,743 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 5666 transitions. Word has length 20 [2021-11-07 01:00:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:01,743 INFO L470 AbstractCegarLoop]: Abstraction has 2485 states and 5666 transitions. [2021-11-07 01:00:01,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 5666 transitions. [2021-11-07 01:00:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 01:00:01,745 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:01,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:01,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-07 01:00:01,745 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash 99628254, now seen corresponding path program 9 times [2021-11-07 01:00:01,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:01,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002602805] [2021-11-07 01:00:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:01,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:02,268 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:02,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002602805] [2021-11-07 01:00:02,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002602805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:02,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:02,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 01:00:02,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220629212] [2021-11-07 01:00:02,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:00:02,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:02,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:00:02,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:00:02,270 INFO L87 Difference]: Start difference. First operand 2485 states and 5666 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:05,443 INFO L93 Difference]: Finished difference Result 3408 states and 7755 transitions. [2021-11-07 01:00:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-07 01:00:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 01:00:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:05,448 INFO L225 Difference]: With dead ends: 3408 [2021-11-07 01:00:05,448 INFO L226 Difference]: Without dead ends: 3408 [2021-11-07 01:00:05,449 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 01:00:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2021-11-07 01:00:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 2641. [2021-11-07 01:00:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2631 states have (on average 2.3044469783352337) internal successors, (6063), 2640 states have internal predecessors, (6063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 6063 transitions. [2021-11-07 01:00:05,500 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 6063 transitions. Word has length 20 [2021-11-07 01:00:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:05,500 INFO L470 AbstractCegarLoop]: Abstraction has 2641 states and 6063 transitions. [2021-11-07 01:00:05,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 6063 transitions. [2021-11-07 01:00:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 01:00:05,502 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:05,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:05,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-07 01:00:05,502 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1899901384, now seen corresponding path program 10 times [2021-11-07 01:00:05,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:05,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452730387] [2021-11-07 01:00:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:05,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:05,867 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:05,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452730387] [2021-11-07 01:00:05,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452730387] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:05,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:05,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 01:00:05,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538495040] [2021-11-07 01:00:05,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 01:00:05,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 01:00:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:00:05,868 INFO L87 Difference]: Start difference. First operand 2641 states and 6063 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:07,908 INFO L93 Difference]: Finished difference Result 2683 states and 6147 transitions. [2021-11-07 01:00:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:00:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 01:00:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:07,912 INFO L225 Difference]: With dead ends: 2683 [2021-11-07 01:00:07,912 INFO L226 Difference]: Without dead ends: 2683 [2021-11-07 01:00:07,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:00:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2021-11-07 01:00:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2643. [2021-11-07 01:00:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2633 states have (on average 2.3034561336878085) internal successors, (6065), 2642 states have internal predecessors, (6065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 6065 transitions. [2021-11-07 01:00:07,973 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 6065 transitions. Word has length 20 [2021-11-07 01:00:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:07,974 INFO L470 AbstractCegarLoop]: Abstraction has 2643 states and 6065 transitions. [2021-11-07 01:00:07,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 6065 transitions. [2021-11-07 01:00:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 01:00:07,975 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:07,975 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:07,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-07 01:00:07,976 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1135871890, now seen corresponding path program 11 times [2021-11-07 01:00:07,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:07,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373911833] [2021-11-07 01:00:07,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:07,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:08,461 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:08,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373911833] [2021-11-07 01:00:08,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373911833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:08,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:08,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 01:00:08,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660528381] [2021-11-07 01:00:08,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:00:08,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:08,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:00:08,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:00:08,463 INFO L87 Difference]: Start difference. First operand 2643 states and 6065 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:11,638 INFO L93 Difference]: Finished difference Result 3766 states and 8600 transitions. [2021-11-07 01:00:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 01:00:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 01:00:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:11,643 INFO L225 Difference]: With dead ends: 3766 [2021-11-07 01:00:11,643 INFO L226 Difference]: Without dead ends: 3766 [2021-11-07 01:00:11,644 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 01:00:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2021-11-07 01:00:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 2563. [2021-11-07 01:00:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2553 states have (on average 2.3043478260869565) internal successors, (5883), 2562 states have internal predecessors, (5883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 5883 transitions. [2021-11-07 01:00:11,688 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 5883 transitions. Word has length 20 [2021-11-07 01:00:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:11,689 INFO L470 AbstractCegarLoop]: Abstraction has 2563 states and 5883 transitions. [2021-11-07 01:00:11,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 5883 transitions. [2021-11-07 01:00:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:11,691 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:11,692 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:11,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-07 01:00:11,692 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1320999310, now seen corresponding path program 1 times [2021-11-07 01:00:11,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:11,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593905264] [2021-11-07 01:00:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:11,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:11,845 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:11,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593905264] [2021-11-07 01:00:11,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593905264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:11,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:11,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:00:11,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904489383] [2021-11-07 01:00:11,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:00:11,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:00:11,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:00:11,847 INFO L87 Difference]: Start difference. First operand 2563 states and 5883 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:12,572 INFO L93 Difference]: Finished difference Result 1997 states and 4513 transitions. [2021-11-07 01:00:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:00:12,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:12,576 INFO L225 Difference]: With dead ends: 1997 [2021-11-07 01:00:12,576 INFO L226 Difference]: Without dead ends: 1997 [2021-11-07 01:00:12,576 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2021-11-07 01:00:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2021-11-07 01:00:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1987 states have (on average 2.2712632108706594) internal successors, (4513), 1996 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 4513 transitions. [2021-11-07 01:00:12,623 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 4513 transitions. Word has length 21 [2021-11-07 01:00:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:12,623 INFO L470 AbstractCegarLoop]: Abstraction has 1997 states and 4513 transitions. [2021-11-07 01:00:12,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 4513 transitions. [2021-11-07 01:00:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:12,624 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:12,624 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:12,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-07 01:00:12,624 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash 657845885, now seen corresponding path program 1 times [2021-11-07 01:00:12,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:12,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066441053] [2021-11-07 01:00:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:12,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:13,100 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:13,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066441053] [2021-11-07 01:00:13,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066441053] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:13,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:13,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:13,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965170949] [2021-11-07 01:00:13,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:13,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:13,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:13,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:13,101 INFO L87 Difference]: Start difference. First operand 1997 states and 4513 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:15,263 INFO L93 Difference]: Finished difference Result 2128 states and 4742 transitions. [2021-11-07 01:00:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:00:15,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:15,284 INFO L225 Difference]: With dead ends: 2128 [2021-11-07 01:00:15,284 INFO L226 Difference]: Without dead ends: 2076 [2021-11-07 01:00:15,285 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:00:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2021-11-07 01:00:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2004. [2021-11-07 01:00:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1994 states have (on average 2.2703109327983952) internal successors, (4527), 2003 states have internal predecessors, (4527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 4527 transitions. [2021-11-07 01:00:15,312 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 4527 transitions. Word has length 21 [2021-11-07 01:00:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:15,313 INFO L470 AbstractCegarLoop]: Abstraction has 2004 states and 4527 transitions. [2021-11-07 01:00:15,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 4527 transitions. [2021-11-07 01:00:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:15,314 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:15,314 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:15,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-07 01:00:15,314 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash 684326389, now seen corresponding path program 2 times [2021-11-07 01:00:15,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:15,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432125982] [2021-11-07 01:00:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:15,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:15,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:15,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432125982] [2021-11-07 01:00:15,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432125982] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:15,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:15,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:15,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909513976] [2021-11-07 01:00:15,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:15,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:15,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:15,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:15,803 INFO L87 Difference]: Start difference. First operand 2004 states and 4527 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:17,873 INFO L93 Difference]: Finished difference Result 2147 states and 4780 transitions. [2021-11-07 01:00:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:00:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:17,877 INFO L225 Difference]: With dead ends: 2147 [2021-11-07 01:00:17,877 INFO L226 Difference]: Without dead ends: 2095 [2021-11-07 01:00:17,877 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:00:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2021-11-07 01:00:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2012. [2021-11-07 01:00:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 2002 states have (on average 2.269230769230769) internal successors, (4543), 2011 states have internal predecessors, (4543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 4543 transitions. [2021-11-07 01:00:17,904 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 4543 transitions. Word has length 21 [2021-11-07 01:00:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:17,905 INFO L470 AbstractCegarLoop]: Abstraction has 2012 states and 4543 transitions. [2021-11-07 01:00:17,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 4543 transitions. [2021-11-07 01:00:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:17,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:17,906 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:17,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-07 01:00:17,906 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1849716497, now seen corresponding path program 3 times [2021-11-07 01:00:17,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:17,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463347394] [2021-11-07 01:00:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:17,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:18,350 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:18,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463347394] [2021-11-07 01:00:18,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463347394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:18,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:18,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:18,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69129201] [2021-11-07 01:00:18,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:18,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:18,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:18,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:18,351 INFO L87 Difference]: Start difference. First operand 2012 states and 4543 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:20,610 INFO L93 Difference]: Finished difference Result 2145 states and 4778 transitions. [2021-11-07 01:00:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:00:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:20,613 INFO L225 Difference]: With dead ends: 2145 [2021-11-07 01:00:20,613 INFO L226 Difference]: Without dead ends: 2093 [2021-11-07 01:00:20,613 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:00:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2021-11-07 01:00:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2011. [2021-11-07 01:00:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 2001 states have (on average 2.2693653173413293) internal successors, (4541), 2010 states have internal predecessors, (4541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 4541 transitions. [2021-11-07 01:00:20,641 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 4541 transitions. Word has length 21 [2021-11-07 01:00:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:20,641 INFO L470 AbstractCegarLoop]: Abstraction has 2011 states and 4541 transitions. [2021-11-07 01:00:20,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 4541 transitions. [2021-11-07 01:00:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:20,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:20,643 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:20,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-07 01:00:20,643 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:20,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2109173885, now seen corresponding path program 4 times [2021-11-07 01:00:20,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:20,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385492432] [2021-11-07 01:00:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:20,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:21,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:21,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385492432] [2021-11-07 01:00:21,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385492432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:21,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:21,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:21,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957351792] [2021-11-07 01:00:21,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:21,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:21,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:21,200 INFO L87 Difference]: Start difference. First operand 2011 states and 4541 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:23,465 INFO L93 Difference]: Finished difference Result 2180 states and 4846 transitions. [2021-11-07 01:00:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:00:23,466 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:23,469 INFO L225 Difference]: With dead ends: 2180 [2021-11-07 01:00:23,469 INFO L226 Difference]: Without dead ends: 2128 [2021-11-07 01:00:23,469 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:00:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2021-11-07 01:00:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2034. [2021-11-07 01:00:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 2024 states have (on average 2.266304347826087) internal successors, (4587), 2033 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 4587 transitions. [2021-11-07 01:00:23,497 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 4587 transitions. Word has length 21 [2021-11-07 01:00:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:23,498 INFO L470 AbstractCegarLoop]: Abstraction has 2034 states and 4587 transitions. [2021-11-07 01:00:23,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 4587 transitions. [2021-11-07 01:00:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:23,499 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:23,499 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:23,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-07 01:00:23,499 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:23,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2112824905, now seen corresponding path program 5 times [2021-11-07 01:00:23,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:23,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086919095] [2021-11-07 01:00:23,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:23,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:23,939 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:23,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086919095] [2021-11-07 01:00:23,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086919095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:23,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:23,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:23,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682438095] [2021-11-07 01:00:23,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:23,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:23,941 INFO L87 Difference]: Start difference. First operand 2034 states and 4587 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:26,101 INFO L93 Difference]: Finished difference Result 2179 states and 4846 transitions. [2021-11-07 01:00:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:00:26,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:26,111 INFO L225 Difference]: With dead ends: 2179 [2021-11-07 01:00:26,111 INFO L226 Difference]: Without dead ends: 2127 [2021-11-07 01:00:26,111 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:00:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2021-11-07 01:00:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2040. [2021-11-07 01:00:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2030 states have (on average 2.2655172413793103) internal successors, (4599), 2039 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 4599 transitions. [2021-11-07 01:00:26,139 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 4599 transitions. Word has length 21 [2021-11-07 01:00:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:26,140 INFO L470 AbstractCegarLoop]: Abstraction has 2040 states and 4599 transitions. [2021-11-07 01:00:26,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 4599 transitions. [2021-11-07 01:00:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:26,141 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:26,141 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:26,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-07 01:00:26,141 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1016752283, now seen corresponding path program 6 times [2021-11-07 01:00:26,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:26,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110293743] [2021-11-07 01:00:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:26,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:26,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:26,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110293743] [2021-11-07 01:00:26,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110293743] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:26,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:26,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:26,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424966715] [2021-11-07 01:00:26,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:26,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:26,621 INFO L87 Difference]: Start difference. First operand 2040 states and 4599 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:29,412 INFO L93 Difference]: Finished difference Result 2173 states and 4834 transitions. [2021-11-07 01:00:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:00:29,413 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:29,416 INFO L225 Difference]: With dead ends: 2173 [2021-11-07 01:00:29,416 INFO L226 Difference]: Without dead ends: 2121 [2021-11-07 01:00:29,416 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:00:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2021-11-07 01:00:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2032. [2021-11-07 01:00:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2022 states have (on average 2.2665677546983183) internal successors, (4583), 2031 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 4583 transitions. [2021-11-07 01:00:29,446 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 4583 transitions. Word has length 21 [2021-11-07 01:00:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:29,446 INFO L470 AbstractCegarLoop]: Abstraction has 2032 states and 4583 transitions. [2021-11-07 01:00:29,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 4583 transitions. [2021-11-07 01:00:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:29,448 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:29,448 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:29,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-07 01:00:29,448 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1946675173, now seen corresponding path program 7 times [2021-11-07 01:00:29,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:29,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392096469] [2021-11-07 01:00:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:29,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:29,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:29,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392096469] [2021-11-07 01:00:29,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392096469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:29,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:29,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:29,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130387729] [2021-11-07 01:00:29,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:29,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:29,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:29,988 INFO L87 Difference]: Start difference. First operand 2032 states and 4583 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:31,940 INFO L93 Difference]: Finished difference Result 2223 states and 4932 transitions. [2021-11-07 01:00:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:00:31,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:31,960 INFO L225 Difference]: With dead ends: 2223 [2021-11-07 01:00:31,960 INFO L226 Difference]: Without dead ends: 2171 [2021-11-07 01:00:31,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:00:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2021-11-07 01:00:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2044. [2021-11-07 01:00:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2034 states have (on average 2.2649950835791546) internal successors, (4607), 2043 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 4607 transitions. [2021-11-07 01:00:31,988 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 4607 transitions. Word has length 21 [2021-11-07 01:00:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:31,988 INFO L470 AbstractCegarLoop]: Abstraction has 2044 states and 4607 transitions. [2021-11-07 01:00:31,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 4607 transitions. [2021-11-07 01:00:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:31,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:31,990 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:31,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-07 01:00:31,990 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -966358189, now seen corresponding path program 8 times [2021-11-07 01:00:31,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:31,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955143679] [2021-11-07 01:00:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:31,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:32,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:32,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955143679] [2021-11-07 01:00:32,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955143679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:32,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:32,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:32,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446752069] [2021-11-07 01:00:32,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:32,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:32,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:32,504 INFO L87 Difference]: Start difference. First operand 2044 states and 4607 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:34,722 INFO L93 Difference]: Finished difference Result 2220 states and 4928 transitions. [2021-11-07 01:00:34,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:00:34,723 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:34,726 INFO L225 Difference]: With dead ends: 2220 [2021-11-07 01:00:34,726 INFO L226 Difference]: Without dead ends: 2168 [2021-11-07 01:00:34,726 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:00:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2021-11-07 01:00:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2056. [2021-11-07 01:00:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2046 states have (on average 2.263440860215054) internal successors, (4631), 2055 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 4631 transitions. [2021-11-07 01:00:34,754 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 4631 transitions. Word has length 21 [2021-11-07 01:00:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:34,754 INFO L470 AbstractCegarLoop]: Abstraction has 2056 states and 4631 transitions. [2021-11-07 01:00:34,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 4631 transitions. [2021-11-07 01:00:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:34,755 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:34,755 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:34,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-07 01:00:34,755 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1254709461, now seen corresponding path program 9 times [2021-11-07 01:00:34,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:34,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789975334] [2021-11-07 01:00:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:34,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:35,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:35,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789975334] [2021-11-07 01:00:35,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789975334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:35,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:35,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:35,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822320298] [2021-11-07 01:00:35,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:35,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:35,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:35,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:35,251 INFO L87 Difference]: Start difference. First operand 2056 states and 4631 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:37,934 INFO L93 Difference]: Finished difference Result 2213 states and 4914 transitions. [2021-11-07 01:00:37,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:00:37,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:37,936 INFO L225 Difference]: With dead ends: 2213 [2021-11-07 01:00:37,936 INFO L226 Difference]: Without dead ends: 2161 [2021-11-07 01:00:37,937 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:00:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2021-11-07 01:00:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2062. [2021-11-07 01:00:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 2052 states have (on average 2.262670565302144) internal successors, (4643), 2061 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 4643 transitions. [2021-11-07 01:00:37,972 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 4643 transitions. Word has length 21 [2021-11-07 01:00:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:37,973 INFO L470 AbstractCegarLoop]: Abstraction has 2062 states and 4643 transitions. [2021-11-07 01:00:37,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 4643 transitions. [2021-11-07 01:00:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:37,974 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:37,974 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:37,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-07 01:00:37,975 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1251058441, now seen corresponding path program 10 times [2021-11-07 01:00:37,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:37,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165177193] [2021-11-07 01:00:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:37,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:38,445 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:38,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165177193] [2021-11-07 01:00:38,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165177193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:38,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:38,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:38,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117444510] [2021-11-07 01:00:38,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:38,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:38,447 INFO L87 Difference]: Start difference. First operand 2062 states and 4643 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:41,390 INFO L93 Difference]: Finished difference Result 2207 states and 4902 transitions. [2021-11-07 01:00:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:00:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:41,394 INFO L225 Difference]: With dead ends: 2207 [2021-11-07 01:00:41,394 INFO L226 Difference]: Without dead ends: 2155 [2021-11-07 01:00:41,395 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:00:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2021-11-07 01:00:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2068. [2021-11-07 01:00:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 2058 states have (on average 2.261904761904762) internal successors, (4655), 2067 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 4655 transitions. [2021-11-07 01:00:41,424 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 4655 transitions. Word has length 21 [2021-11-07 01:00:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:41,424 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 4655 transitions. [2021-11-07 01:00:41,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 4655 transitions. [2021-11-07 01:00:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:41,425 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:41,425 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:41,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-07 01:00:41,425 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:41,426 INFO L85 PathProgramCache]: Analyzing trace with hash -85668333, now seen corresponding path program 11 times [2021-11-07 01:00:41,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:41,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872647932] [2021-11-07 01:00:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:41,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:41,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:41,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872647932] [2021-11-07 01:00:41,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872647932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:41,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:41,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:41,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476938855] [2021-11-07 01:00:41,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:41,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:41,867 INFO L87 Difference]: Start difference. First operand 2068 states and 4655 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:44,137 INFO L93 Difference]: Finished difference Result 2201 states and 4890 transitions. [2021-11-07 01:00:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:00:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:44,141 INFO L225 Difference]: With dead ends: 2201 [2021-11-07 01:00:44,141 INFO L226 Difference]: Without dead ends: 2149 [2021-11-07 01:00:44,142 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:00:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2021-11-07 01:00:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2039. [2021-11-07 01:00:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 2029 states have (on average 2.2656481025135533) internal successors, (4597), 2038 states have internal predecessors, (4597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 4597 transitions. [2021-11-07 01:00:44,183 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 4597 transitions. Word has length 21 [2021-11-07 01:00:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:44,183 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 4597 transitions. [2021-11-07 01:00:44,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 4597 transitions. [2021-11-07 01:00:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:44,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:44,184 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:44,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-07 01:00:44,185 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:44,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash -228848851, now seen corresponding path program 12 times [2021-11-07 01:00:44,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:44,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058942753] [2021-11-07 01:00:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:44,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:44,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:44,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058942753] [2021-11-07 01:00:44,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058942753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:44,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:44,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:44,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813925729] [2021-11-07 01:00:44,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:44,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:44,699 INFO L87 Difference]: Start difference. First operand 2039 states and 4597 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:47,229 INFO L93 Difference]: Finished difference Result 2188 states and 4862 transitions. [2021-11-07 01:00:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:00:47,230 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:47,234 INFO L225 Difference]: With dead ends: 2188 [2021-11-07 01:00:47,235 INFO L226 Difference]: Without dead ends: 2136 [2021-11-07 01:00:47,235 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:00:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2021-11-07 01:00:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2044. [2021-11-07 01:00:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2034 states have (on average 2.2649950835791546) internal successors, (4607), 2043 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 4607 transitions. [2021-11-07 01:00:47,266 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 4607 transitions. Word has length 21 [2021-11-07 01:00:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:47,266 INFO L470 AbstractCegarLoop]: Abstraction has 2044 states and 4607 transitions. [2021-11-07 01:00:47,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 4607 transitions. [2021-11-07 01:00:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:47,267 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:47,267 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:47,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-07 01:00:47,268 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 751468133, now seen corresponding path program 13 times [2021-11-07 01:00:47,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:47,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535782554] [2021-11-07 01:00:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:47,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:47,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:47,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535782554] [2021-11-07 01:00:47,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535782554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:47,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:47,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:47,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432568847] [2021-11-07 01:00:47,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:47,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:47,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:47,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:47,878 INFO L87 Difference]: Start difference. First operand 2044 states and 4607 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:50,402 INFO L93 Difference]: Finished difference Result 2185 states and 4858 transitions. [2021-11-07 01:00:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:00:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:50,405 INFO L225 Difference]: With dead ends: 2185 [2021-11-07 01:00:50,405 INFO L226 Difference]: Without dead ends: 2133 [2021-11-07 01:00:50,406 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:00:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2021-11-07 01:00:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2042. [2021-11-07 01:00:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 2032 states have (on average 2.265255905511811) internal successors, (4603), 2041 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 4603 transitions. [2021-11-07 01:00:50,432 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 4603 transitions. Word has length 21 [2021-11-07 01:00:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:50,432 INFO L470 AbstractCegarLoop]: Abstraction has 2042 states and 4603 transitions. [2021-11-07 01:00:50,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 4603 transitions. [2021-11-07 01:00:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:50,433 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:50,433 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:50,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-07 01:00:50,433 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 463116861, now seen corresponding path program 14 times [2021-11-07 01:00:50,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:50,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890892283] [2021-11-07 01:00:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:50,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:50,868 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:50,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890892283] [2021-11-07 01:00:50,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890892283] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:50,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:50,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:50,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599109511] [2021-11-07 01:00:50,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:50,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:50,869 INFO L87 Difference]: Start difference. First operand 2042 states and 4603 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:53,240 INFO L93 Difference]: Finished difference Result 2178 states and 4844 transitions. [2021-11-07 01:00:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:00:53,241 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:53,244 INFO L225 Difference]: With dead ends: 2178 [2021-11-07 01:00:53,244 INFO L226 Difference]: Without dead ends: 2126 [2021-11-07 01:00:53,244 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:00:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2021-11-07 01:00:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2041. [2021-11-07 01:00:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2031 states have (on average 2.2653865091088132) internal successors, (4601), 2040 states have internal predecessors, (4601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 4601 transitions. [2021-11-07 01:00:53,269 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 4601 transitions. Word has length 21 [2021-11-07 01:00:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:53,269 INFO L470 AbstractCegarLoop]: Abstraction has 2041 states and 4601 transitions. [2021-11-07 01:00:53,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 4601 transitions. [2021-11-07 01:00:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:53,270 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:53,270 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:53,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-07 01:00:53,270 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 466767881, now seen corresponding path program 15 times [2021-11-07 01:00:53,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:53,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316597626] [2021-11-07 01:00:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:53,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:53,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:53,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316597626] [2021-11-07 01:00:53,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316597626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:53,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:53,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:53,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003613727] [2021-11-07 01:00:53,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:53,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:53,704 INFO L87 Difference]: Start difference. First operand 2041 states and 4601 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:55,929 INFO L93 Difference]: Finished difference Result 2172 states and 4832 transitions. [2021-11-07 01:00:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:00:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:55,932 INFO L225 Difference]: With dead ends: 2172 [2021-11-07 01:00:55,932 INFO L226 Difference]: Without dead ends: 2120 [2021-11-07 01:00:55,933 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:00:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2021-11-07 01:00:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2040. [2021-11-07 01:00:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2030 states have (on average 2.2655172413793103) internal successors, (4599), 2039 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 4599 transitions. [2021-11-07 01:00:55,968 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 4599 transitions. Word has length 21 [2021-11-07 01:00:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:55,969 INFO L470 AbstractCegarLoop]: Abstraction has 2040 states and 4599 transitions. [2021-11-07 01:00:55,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 4599 transitions. [2021-11-07 01:00:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:55,970 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:55,970 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:55,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-07 01:00:55,971 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1632157989, now seen corresponding path program 16 times [2021-11-07 01:00:55,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:55,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779459431] [2021-11-07 01:00:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:55,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:56,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:56,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779459431] [2021-11-07 01:00:56,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779459431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:56,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:56,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-07 01:00:56,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650053537] [2021-11-07 01:00:56,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:00:56,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:00:56,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:00:56,357 INFO L87 Difference]: Start difference. First operand 2040 states and 4599 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:58,478 INFO L93 Difference]: Finished difference Result 2150 states and 4782 transitions. [2021-11-07 01:00:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:00:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:00:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:58,481 INFO L225 Difference]: With dead ends: 2150 [2021-11-07 01:00:58,481 INFO L226 Difference]: Without dead ends: 2098 [2021-11-07 01:00:58,481 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:00:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-11-07 01:00:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1981. [2021-11-07 01:00:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1971 states have (on average 2.2704211060375443) internal successors, (4475), 1980 states have internal predecessors, (4475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 4475 transitions. [2021-11-07 01:00:58,523 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 4475 transitions. Word has length 21 [2021-11-07 01:00:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:58,523 INFO L470 AbstractCegarLoop]: Abstraction has 1981 states and 4475 transitions. [2021-11-07 01:00:58,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 4475 transitions. [2021-11-07 01:00:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:00:58,524 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:58,524 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:58,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-07 01:00:58,525 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:00:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1344924767, now seen corresponding path program 1 times [2021-11-07 01:00:58,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:58,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591670837] [2021-11-07 01:00:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:58,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:59,395 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:59,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591670837] [2021-11-07 01:00:59,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591670837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:59,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:59,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:00:59,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265290151] [2021-11-07 01:00:59,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:00:59,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:59,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:00:59,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:00:59,396 INFO L87 Difference]: Start difference. First operand 1981 states and 4475 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:02,263 INFO L93 Difference]: Finished difference Result 2283 states and 5088 transitions. [2021-11-07 01:01:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:01:02,264 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:01:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:02,266 INFO L225 Difference]: With dead ends: 2283 [2021-11-07 01:01:02,266 INFO L226 Difference]: Without dead ends: 2226 [2021-11-07 01:01:02,266 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:01:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2021-11-07 01:01:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2017. [2021-11-07 01:01:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2007 states have (on average 2.2725460886895865) internal successors, (4561), 2016 states have internal predecessors, (4561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4561 transitions. [2021-11-07 01:01:02,296 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 4561 transitions. Word has length 23 [2021-11-07 01:01:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:02,296 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 4561 transitions. [2021-11-07 01:01:02,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 4561 transitions. [2021-11-07 01:01:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:01:02,298 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:02,298 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:02,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-07 01:01:02,299 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:01:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1268343739, now seen corresponding path program 1 times [2021-11-07 01:01:02,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:02,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138069167] [2021-11-07 01:01:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:02,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:02,750 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:02,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138069167] [2021-11-07 01:01:02,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138069167] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:01:02,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188328978] [2021-11-07 01:01:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:02,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:01:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:01:02,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:01:02,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:01:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:03,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-07 01:01:03,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:01:03,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:01:03,436 INFO L354 Elim1Store]: treesize reduction 560, result has 7.0 percent of original size [2021-11-07 01:01:03,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 270 treesize of output 198 [2021-11-07 01:01:03,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:01:03,576 INFO L354 Elim1Store]: treesize reduction 754, result has 7.1 percent of original size [2021-11-07 01:01:03,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 259 treesize of output 155 [2021-11-07 01:01:03,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 242 [2021-11-07 01:01:04,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:01:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:01:04,390 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-07 01:01:04,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 78 [2021-11-07 01:01:04,769 INFO L354 Elim1Store]: treesize reduction 354, result has 14.3 percent of original size [2021-11-07 01:01:04,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 112 treesize of output 98 [2021-11-07 01:01:05,009 INFO L354 Elim1Store]: treesize reduction 214, result has 12.7 percent of original size [2021-11-07 01:01:05,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 129 treesize of output 72 [2021-11-07 01:01:05,485 INFO L354 Elim1Store]: treesize reduction 150, result has 28.9 percent of original size [2021-11-07 01:01:05,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 97 [2021-11-07 01:01:11,891 INFO L354 Elim1Store]: treesize reduction 82, result has 32.2 percent of original size [2021-11-07 01:01:11,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 75 [2021-11-07 01:01:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:11,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:01:14,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) is different from false [2021-11-07 01:01:16,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) is different from false [2021-11-07 01:01:18,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|)))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) is different from false [2021-11-07 01:01:18,159 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:01:18,160 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-11-07 01:01:20,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) is different from false [2021-11-07 01:01:22,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) is different from false [2021-11-07 01:01:24,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse2 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse2))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|)))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) is different from false [2021-11-07 01:01:26,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse5 (+ c_pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5) 12))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) is different from false [2021-11-07 01:01:28,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse5 (+ c_pusherThread1of1ForFork0_~q~0.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_~q~0.base) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_~q~0.base) .cse5) 12))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) is different from false [2021-11-07 01:01:30,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse5 (+ 4 |c_pusherThread1of1ForFork0_#in~q_.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_.base|) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_.base|) .cse5) 12))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) is different from false [2021-11-07 01:01:32,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse5 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1.base|) .cse5) 12))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) is different from false [2021-11-07 01:01:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-07 01:01:32,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188328978] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:01:32,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [636201658] [2021-11-07 01:01:32,402 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:01:32,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:01:32,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 35 [2021-11-07 01:01:32,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060137039] [2021-11-07 01:01:32,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-07 01:01:32,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:32,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-07 01:01:32,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=579, Unknown=13, NotChecked=570, Total=1260 [2021-11-07 01:01:32,404 INFO L87 Difference]: Start difference. First operand 2017 states and 4561 transitions. Second operand has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:34,663 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#q~1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4)) (.cse3 (+ .cse0 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse9 (+ .cse0 16)) (.cse8 (select |c_#memory_$Pointer$.base| .cse7)) (.cse5 (+ .cse0 12))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1.base|) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= .cse0 (select .cse1 .cse2)) (= .cse3 (select .cse4 .cse5)) (= (select .cse6 .cse2) .cse7) (= (select .cse4 .cse0) .cse3) (= (select .cse8 .cse9) 0) (= (select .cse8 .cse0) .cse7) (not (= .cse7 0)) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse10 (let ((.cse15 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|) .cse15)) (.cse13 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1.base|) .cse15) 12))) (let ((.cse11 (let ((.cse14 (select (select |c_#memory_$Pointer$.base| .cse12) .cse13))) (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse10 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse10 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (< .cse7 |c_#StackHeapBarrier|) (= (select .cse4 .cse9) 0) (= (select .cse8 .cse5) .cse7))))) is different from false [2021-11-07 01:01:36,668 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#q~1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4)) (.cse3 (+ .cse0 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse9 (+ .cse0 16)) (.cse8 (select |c_#memory_$Pointer$.base| .cse7)) (.cse5 (+ .cse0 12))) (and (= |c_ULTIMATE.start_main_~#q~1.offset| |c_pusherThread1of1ForFork0_#in~q_.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1.base|) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= .cse0 (select .cse1 .cse2)) (= .cse3 (select .cse4 .cse5)) (= (select .cse6 .cse2) .cse7) (= (select .cse4 .cse0) .cse3) (= (select .cse8 .cse9) 0) (= (select .cse8 .cse0) .cse7) (not (= .cse7 0)) (= |c_ULTIMATE.start_main_~#q~1.base| |c_pusherThread1of1ForFork0_#in~q_.base|) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse10 (let ((.cse15 (+ 4 |c_pusherThread1of1ForFork0_#in~q_.offset|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_.base|) .cse15)) (.cse13 (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_.base|) .cse15) 12))) (let ((.cse11 (let ((.cse14 (select (select |c_#memory_$Pointer$.base| .cse12) .cse13))) (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse10 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse10 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (< .cse7 |c_#StackHeapBarrier|) (= (select .cse4 .cse9) 0) (= (select .cse8 .cse5) .cse7))))) is different from false [2021-11-07 01:01:38,673 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#q~1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4)) (.cse3 (+ .cse0 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse9 (+ .cse0 16)) (.cse8 (select |c_#memory_$Pointer$.base| .cse7)) (.cse5 (+ .cse0 12))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1.base|) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= .cse0 (select .cse1 .cse2)) (= .cse3 (select .cse4 .cse5)) (= c_pusherThread1of1ForFork0_~q~0.base |c_ULTIMATE.start_main_~#q~1.base|) (= (select .cse6 .cse2) .cse7) (= |c_ULTIMATE.start_main_~#q~1.offset| c_pusherThread1of1ForFork0_~q~0.offset) (= (select .cse4 .cse0) .cse3) (= (select .cse8 .cse9) 0) (= (select .cse8 .cse0) .cse7) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse10 (let ((.cse15 (+ c_pusherThread1of1ForFork0_~q~0.offset 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_~q~0.base) .cse15)) (.cse13 (+ (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_~q~0.base) .cse15) 12))) (let ((.cse11 (let ((.cse14 (select (select |c_#memory_$Pointer$.base| .cse12) .cse13))) (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse10 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse10 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (not (= .cse7 0)) (< .cse7 |c_#StackHeapBarrier|) (= (select .cse4 .cse9) 0) (= (select .cse8 .cse5) .cse7))))) is different from false [2021-11-07 01:01:40,678 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#q~1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4)) (.cse9 (+ .cse6 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse14)) (.cse16 (+ .cse6 16)) (.cse15 (select |c_#memory_$Pointer$.base| .cse14)) (.cse11 (+ .cse6 12)) (.cse12 (+ c_pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse5 (+ c_pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5) 12))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1.base|) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= .cse6 (select .cse7 .cse8)) (= .cse9 (select .cse10 .cse11)) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse12) |c_pusherThread1of1ForFork0_fifo_push_#t~mem22.base|) (= (select .cse13 .cse8) .cse14) (= |c_ULTIMATE.start_main_~#q~1.offset| c_pusherThread1of1ForFork0_fifo_push_~self.offset) (= (select .cse10 .cse6) .cse9) (= (select .cse15 .cse16) 0) (= (select .cse15 .cse6) .cse14) (not (= .cse14 0)) (< .cse14 |c_#StackHeapBarrier|) (= (select .cse10 .cse16) 0) (= (select .cse15 .cse11) .cse14) (= (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse12) |c_pusherThread1of1ForFork0_fifo_push_#t~mem22.offset|) (= |c_ULTIMATE.start_main_~#q~1.base| c_pusherThread1of1ForFork0_fifo_push_~self.base))))) is different from false [2021-11-07 01:01:42,693 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#q~1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4)) (.cse9 (+ .cse6 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse15 (+ .cse6 16)) (.cse14 (select |c_#memory_$Pointer$.base| .cse13)) (.cse11 (+ .cse6 12))) (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse5 (+ c_pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5) 12))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1.base|) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= .cse6 (select .cse7 .cse8)) (= .cse9 (select .cse10 .cse11)) (= (select .cse12 .cse8) .cse13) (= |c_ULTIMATE.start_main_~#q~1.offset| c_pusherThread1of1ForFork0_fifo_push_~self.offset) (= (select .cse10 .cse6) .cse9) (= (select .cse14 .cse15) 0) (= (select .cse14 .cse6) .cse13) (not (= .cse13 0)) (< .cse13 |c_#StackHeapBarrier|) (= (select .cse10 .cse15) 0) (= (select .cse14 .cse11) .cse13) (= |c_ULTIMATE.start_main_~#q~1.base| c_pusherThread1of1ForFork0_fifo_push_~self.base))))) is different from false [2021-11-07 01:01:44,699 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1.base|) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse5 (+ c_pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) .cse5) 12))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (let ((.cse6 (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base))) (= (select .cse6 .cse7) (select .cse6 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base))) (= (select .cse8 .cse7) (select .cse8 |c_ULTIMATE.start_main_~#q~1.offset|))) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0) (= |c_ULTIMATE.start_main_~#q~1.base| c_pusherThread1of1ForFork0_fifo_push_~self.base))) is different from false [2021-11-07 01:01:46,751 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse0 (select .cse7 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4))) (.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1.base|) (= .cse0 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|)) (= .cse0 .cse1) (= (select .cse2 c_pusherThread1of1ForFork0_fifo_push_~t~0.offset) .cse1) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|) c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= (select .cse2 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0) (not (= .cse1 0)) (= .cse1 (select .cse2 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse3 (let ((.cse5 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse5))) (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse4 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse4 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|)))))) (store .cse3 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse3 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (< .cse1 |c_#StackHeapBarrier|) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0) (= |c_ULTIMATE.start_main_~#q~1.base| c_pusherThread1of1ForFork0_fifo_push_~self.base))))) is different from false [2021-11-07 01:01:48,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#q~1.offset|))) (let ((.cse0 (select .cse6 (+ |c_ULTIMATE.start_main_~#q~1.offset| 4))) (.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1.base|) (= .cse0 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse1) |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|)) (= .cse0 .cse2) (= (select .cse3 c_pusherThread1of1ForFork0_fifo_push_~t~0.offset) .cse2) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|) c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= (select .cse3 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse5 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse5 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse4 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse4 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (not (= .cse2 0)) (= .cse2 (select .cse3 .cse1)) (< .cse2 |c_#StackHeapBarrier|) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0) (= |c_ULTIMATE.start_main_~#q~1.base| c_pusherThread1of1ForFork0_fifo_push_~self.base))))) is different from false [2021-11-07 01:01:50,786 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1.base|) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|) c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse2 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse2))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3))))) (store .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|)))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0) (= |c_ULTIMATE.start_main_~#q~1.base| c_pusherThread1of1ForFork0_fifo_push_~self.base)) is different from false [2021-11-07 01:01:52,840 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1.base|) (= |c_ULTIMATE.start_main_~#q~1.offset| 0) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) |c_ULTIMATE.start_main_~#q~1.offset|) c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) |c_ULTIMATE.start_main_~#q~1.base|) |c_ULTIMATE.start_main_~#q~1.offset|) 0)))) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0) (= |c_ULTIMATE.start_main_~#q~1.base| c_pusherThread1of1ForFork0_fifo_push_~self.base)) is different from false [2021-11-07 01:01:54,855 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse4 (select .cse6 0))) (let ((.cse0 (select .cse6 4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4)) (.cse1 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (and (= .cse0 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse1) |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) (< |c_#StackHeapBarrier| c_ULTIMATE.start_fifo_front_~self.base) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse3 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse3 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse2 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse2 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_front_~self.base) (= .cse4 (select .cse5 c_pusherThread1of1ForFork0_fifo_push_~t~0.offset)) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse4 0)) (= .cse4 .cse0) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) c_ULTIMATE.start_fifo_front_~self.offset)) (= (select .cse5 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0) (= (select .cse5 .cse1) .cse4) (< .cse4 |c_#StackHeapBarrier|) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0))))) is different from false [2021-11-07 01:01:56,932 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_front_~self.base) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |c_#memory_$Pointer$.offset| c_pusherThread1of1ForFork0_fifo_push_~self.base) c_ULTIMATE.start_fifo_front_~self.offset)) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0)) is different from false [2021-11-07 01:01:58,948 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse4 (select .cse6 0))) (let ((.cse0 (select .cse6 4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4)) (.cse1 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (and (= .cse0 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) .cse1) |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) (< |c_#StackHeapBarrier| c_ULTIMATE.start_fifo_front_~self.base) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse3 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse3 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse2 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse2 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (= .cse4 (select .cse5 c_pusherThread1of1ForFork0_fifo_push_~t~0.offset)) (= |c_ULTIMATE.start_fifo_empty_#t~mem6.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse4 0)) (= .cse4 .cse0) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_empty_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (= (select .cse5 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0) (= (select .cse5 .cse1) .cse4) (< .cse4 |c_#StackHeapBarrier|) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0))))) is different from false [2021-11-07 01:02:00,893 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| c_ULTIMATE.start_fifo_front_~self.base) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (= .cse3 (select .cse2 c_pusherThread1of1ForFork0_fifo_push_~t~0.offset))) (.cse1 (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) .cse3))) (or (and (or .cse0 .cse1) (= (select .cse2 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0)) (and .cse0 .cse1)))) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse3 0)) (= .cse3 (select .cse4 4)) (= .cse3 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|)))) (store .cse5 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse5 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (< .cse3 |c_#StackHeapBarrier|)))) is different from false [2021-11-07 01:02:02,948 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_DerPreprocessor_3 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| v_DerPreprocessor_3)))) (store .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select .cse1 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|))))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem6.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_empty_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0)) is different from false [2021-11-07 01:02:04,952 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| c_ULTIMATE.start_fifo_front_~self.base) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (= .cse3 (select .cse2 c_pusherThread1of1ForFork0_fifo_push_~t~0.offset))) (.cse1 (= (select (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) .cse3))) (or (and (or .cse0 .cse1) (= (select .cse2 (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0)) (and .cse0 .cse1)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem6.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse3 0)) (= .cse3 (select .cse4 4)) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_empty_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (= .cse3 c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|)))) (store .cse5 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse5 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (< .cse3 |c_#StackHeapBarrier|) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0)))) is different from false [2021-11-07 01:02:06,992 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_fifo_empty_#t~mem6.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_empty_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem29.base| Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base (store (select |c_#memory_$Pointer$.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ c_pusherThread1of1ForFork0_fifo_push_~t~0.offset 12) |pusherThread1of1ForFork0_fifo_push_#t~mem29.base|)))) (store .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select .cse0 v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0)) is different from false [2021-11-07 01:02:08,987 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse0 (select .cse1 0))) (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (< |c_#StackHeapBarrier| c_ULTIMATE.start_fifo_front_~self.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse0 0)) (= .cse0 (select .cse1 4)) (< .cse0 |c_#StackHeapBarrier|) (or (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0)) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0)) (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0))) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse2) pusherThread1of1ForFork0_fifo_push_~t~0.offset)))))))) is different from false [2021-11-07 01:02:11,038 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse0 (select .cse1 0))) (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (< |c_#StackHeapBarrier| c_ULTIMATE.start_fifo_front_~self.base) (= |c_ULTIMATE.start_fifo_empty_#t~mem6.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse0 0)) (= .cse0 (select .cse1 4)) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_empty_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (< .cse0 |c_#StackHeapBarrier|) (or (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0)) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0)) (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0))) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse2) pusherThread1of1ForFork0_fifo_push_~t~0.offset))))) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0)))) is different from false [2021-11-07 01:02:12,697 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem6.base| c_pusherThread1of1ForFork0_fifo_push_~t~0.base) (<= (+ |c_#StackHeapBarrier| 1) c_pusherThread1of1ForFork0_fifo_push_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~self.base c_ULTIMATE.start_fifo_empty_~self.base) (= c_pusherThread1of1ForFork0_fifo_push_~t~0.offset |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (= c_pusherThread1of1ForFork0_fifo_push_~self.offset 0)) is different from false [2021-11-07 01:02:14,713 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse1 (+ 4 c_ULTIMATE.start_fifo_empty_~self.offset)) (.cse0 (select .cse2 0))) (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (< |c_#StackHeapBarrier| c_ULTIMATE.start_fifo_front_~self.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_empty_~self.base) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem6.base|) (<= (+ |c_#StackHeapBarrier| 1) c_ULTIMATE.start_fifo_empty_~self.base) (= .cse0 (select .cse2 4)) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_fifo_empty_~self.base) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (< .cse0 |c_#StackHeapBarrier|) (or (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0)) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0)) (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0))) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) pusherThread1of1ForFork0_fifo_push_~t~0.offset)))))))) is different from false [2021-11-07 01:02:16,806 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_ULTIMATE.start_fifo_empty_~self.offset))) (and (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (<= |c_#StackHeapBarrier| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)))) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_empty_~self.base) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem6.base|) (<= (+ |c_#StackHeapBarrier| 1) c_ULTIMATE.start_fifo_empty_~self.base) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_fifo_empty_~self.base) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0))) is different from false [2021-11-07 01:02:18,922 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse0 (select .cse1 0))) (and (< (+ .cse0 1) c_ULTIMATE.start_fifo_front_~self.base) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse0 0)) (= .cse0 (select .cse1 4)) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| 1) c_ULTIMATE.start_fifo_front_~self.base) (or (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0)) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0)) (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0))) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse2) pusherThread1of1ForFork0_fifo_push_~t~0.offset)))))))) is different from false [2021-11-07 01:02:21,007 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base))) (let ((.cse0 (select .cse2 0)) (.cse1 (+ 4 c_ULTIMATE.start_fifo_empty_~self.offset))) (and (< (+ .cse0 1) c_ULTIMATE.start_fifo_front_~self.base) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| c_ULTIMATE.start_fifo_empty_~self.base)) (= c_ULTIMATE.start_fifo_front_~self.offset 0) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_empty_~self.base) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem6.base|) (= .cse0 (select .cse2 4)) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_fifo_empty_~self.base) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0) (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| 1) c_ULTIMATE.start_fifo_front_~self.base) (or (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0)) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 16)) 0)) (exists ((pusherThread1of1ForFork0_fifo_push_~t~0.offset Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_front_~self.base) 0))) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) pusherThread1of1ForFork0_fifo_push_~t~0.offset)))))))) is different from false [2021-11-07 01:02:23,023 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_ULTIMATE.start_fifo_empty_~self.offset))) (and (not (= |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| c_ULTIMATE.start_fifo_empty_~self.base)) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_fifo_empty_~self.base) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem6.base|) (forall ((v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 Int) (v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484 (store (select |c_#memory_$Pointer$.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484) (+ v_pusherThread1of1ForFork0_fifo_node_init_~self.offset_484 12) v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484)) c_ULTIMATE.start_fifo_front_~self.base) c_ULTIMATE.start_fifo_front_~self.offset) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self.base| v_pusherThread1of1ForFork0_fifo_node_init_~self.base_484))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_fifo_empty_~self.base) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= c_ULTIMATE.start_fifo_empty_~self.offset 0))) is different from false [2021-11-07 01:02:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:24,695 INFO L93 Difference]: Finished difference Result 2251 states and 5075 transitions. [2021-11-07 01:02:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-07 01:02:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:02:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:24,700 INFO L225 Difference]: With dead ends: 2251 [2021-11-07 01:02:24,700 INFO L226 Difference]: Without dead ends: 2251 [2021-11-07 01:02:24,700 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 76.7s TimeCoverageRelationStatistics Valid=182, Invalid=976, Unknown=38, NotChecked=3360, Total=4556 [2021-11-07 01:02:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2021-11-07 01:02:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2068. [2021-11-07 01:02:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 2058 states have (on average 2.2735665694849367) internal successors, (4679), 2067 states have internal predecessors, (4679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 4679 transitions. [2021-11-07 01:02:24,740 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 4679 transitions. Word has length 23 [2021-11-07 01:02:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:24,741 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 4679 transitions. [2021-11-07 01:02:24,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 4679 transitions. [2021-11-07 01:02:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:02:24,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:24,743 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:24,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:02:24,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:02:24,964 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:02:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1883787909, now seen corresponding path program 2 times [2021-11-07 01:02:24,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:24,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610913367] [2021-11-07 01:02:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:24,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:25,227 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:25,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610913367] [2021-11-07 01:02:25,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610913367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:25,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:25,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 01:02:25,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782777357] [2021-11-07 01:02:25,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:02:25,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:25,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:02:25,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:02:25,228 INFO L87 Difference]: Start difference. First operand 2068 states and 4679 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:28,015 INFO L93 Difference]: Finished difference Result 4252 states and 9477 transitions. [2021-11-07 01:02:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-07 01:02:28,015 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:02:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:28,020 INFO L225 Difference]: With dead ends: 4252 [2021-11-07 01:02:28,020 INFO L226 Difference]: Without dead ends: 4174 [2021-11-07 01:02:28,020 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1004, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 01:02:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2021-11-07 01:02:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 2257. [2021-11-07 01:02:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2247 states have (on average 2.2790387182910545) internal successors, (5121), 2256 states have internal predecessors, (5121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5121 transitions. [2021-11-07 01:02:28,062 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5121 transitions. Word has length 23 [2021-11-07 01:02:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:28,063 INFO L470 AbstractCegarLoop]: Abstraction has 2257 states and 5121 transitions. [2021-11-07 01:02:28,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5121 transitions. [2021-11-07 01:02:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:02:28,065 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:28,065 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:28,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-07 01:02:28,065 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:02:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1960368937, now seen corresponding path program 2 times [2021-11-07 01:02:28,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:28,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511069375] [2021-11-07 01:02:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:28,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:28,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:28,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511069375] [2021-11-07 01:02:28,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511069375] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:02:28,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711676952] [2021-11-07 01:02:28,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:02:28,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:02:28,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:02:28,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:02:28,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:02:29,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-07 01:02:29,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:02:29,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-07 01:02:29,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:29,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:29,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:29,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:29,598 INFO L354 Elim1Store]: treesize reduction 168, result has 18.4 percent of original size [2021-11-07 01:02:29,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 220 treesize of output 160 [2021-11-07 01:02:29,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:29,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:29,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:29,687 INFO L354 Elim1Store]: treesize reduction 168, result has 18.4 percent of original size [2021-11-07 01:02:29,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 100 [2021-11-07 01:02:29,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 432 treesize of output 424 [2021-11-07 01:02:31,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 01:02:31,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,165 INFO L354 Elim1Store]: treesize reduction 372, result has 10.4 percent of original size [2021-11-07 01:02:31,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 217 treesize of output 163 [2021-11-07 01:02:31,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 01:02:31,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,235 INFO L354 Elim1Store]: treesize reduction 320, result has 13.7 percent of original size [2021-11-07 01:02:31,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 164 treesize of output 159 [2021-11-07 01:02:31,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,743 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:02:31,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 120 [2021-11-07 01:02:31,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:02:31,757 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 01:02:31,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 117 [2021-11-07 01:02:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:32,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:32,901 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:02:32,902 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 279 [2021-11-07 01:02:32,907 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:02:32,908 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 383 [2021-11-07 01:02:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:56,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711676952] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:02:56,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1100451892] [2021-11-07 01:02:56,291 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:02:56,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:02:56,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 46 [2021-11-07 01:02:56,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345453985] [2021-11-07 01:02:56,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-07 01:02:56,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:56,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-07 01:02:56,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1972, Unknown=10, NotChecked=0, Total=2162 [2021-11-07 01:02:56,293 INFO L87 Difference]: Start difference. First operand 2257 states and 5121 transitions. Second operand has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 46 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:34,970 INFO L93 Difference]: Finished difference Result 4218 states and 9406 transitions. [2021-11-07 01:03:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-11-07 01:03:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 46 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:34,974 INFO L225 Difference]: With dead ends: 4218 [2021-11-07 01:03:34,974 INFO L226 Difference]: Without dead ends: 4218 [2021-11-07 01:03:34,975 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4134 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=2033, Invalid=14727, Unknown=10, NotChecked=0, Total=16770 [2021-11-07 01:03:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4218 states. [2021-11-07 01:03:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4218 to 2347. [2021-11-07 01:03:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 2337 states have (on average 2.282413350449294) internal successors, (5334), 2346 states have internal predecessors, (5334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 5334 transitions. [2021-11-07 01:03:35,008 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 5334 transitions. Word has length 23 [2021-11-07 01:03:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:35,009 INFO L470 AbstractCegarLoop]: Abstraction has 2347 states and 5334 transitions. [2021-11-07 01:03:35,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 46 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 5334 transitions. [2021-11-07 01:03:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:03:35,010 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:35,010 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:35,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:03:35,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:03:35,210 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:03:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1022885335, now seen corresponding path program 3 times [2021-11-07 01:03:35,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:35,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038088734] [2021-11-07 01:03:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:35,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:36,034 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:36,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038088734] [2021-11-07 01:03:36,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038088734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:36,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:36,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:03:36,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252808851] [2021-11-07 01:03:36,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:03:36,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:03:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:03:36,035 INFO L87 Difference]: Start difference. First operand 2347 states and 5334 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:38,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:38,595 INFO L93 Difference]: Finished difference Result 2636 states and 5922 transitions. [2021-11-07 01:03:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:03:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:38,598 INFO L225 Difference]: With dead ends: 2636 [2021-11-07 01:03:38,598 INFO L226 Difference]: Without dead ends: 2584 [2021-11-07 01:03:38,599 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:03:38,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2021-11-07 01:03:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2332. [2021-11-07 01:03:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2322 states have (on average 2.2825150732127475) internal successors, (5300), 2331 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 5300 transitions. [2021-11-07 01:03:38,627 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 5300 transitions. Word has length 23 [2021-11-07 01:03:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:38,627 INFO L470 AbstractCegarLoop]: Abstraction has 2332 states and 5300 transitions. [2021-11-07 01:03:38,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 5300 transitions. [2021-11-07 01:03:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:03:38,628 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:38,628 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:38,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-07 01:03:38,629 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:03:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash 206761567, now seen corresponding path program 4 times [2021-11-07 01:03:38,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:38,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033725640] [2021-11-07 01:03:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:38,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:39,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:39,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033725640] [2021-11-07 01:03:39,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033725640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:39,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:39,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:03:39,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709172137] [2021-11-07 01:03:39,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:03:39,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:39,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:03:39,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:03:39,494 INFO L87 Difference]: Start difference. First operand 2332 states and 5300 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:42,455 INFO L93 Difference]: Finished difference Result 2647 states and 5931 transitions. [2021-11-07 01:03:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:03:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:42,459 INFO L225 Difference]: With dead ends: 2647 [2021-11-07 01:03:42,459 INFO L226 Difference]: Without dead ends: 2595 [2021-11-07 01:03:42,459 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:03:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2021-11-07 01:03:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2357. [2021-11-07 01:03:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2347 states have (on average 2.28035790370686) internal successors, (5352), 2356 states have internal predecessors, (5352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 5352 transitions. [2021-11-07 01:03:42,490 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 5352 transitions. Word has length 23 [2021-11-07 01:03:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:42,491 INFO L470 AbstractCegarLoop]: Abstraction has 2357 states and 5352 transitions. [2021-11-07 01:03:42,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 5352 transitions. [2021-11-07 01:03:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:03:42,492 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:42,492 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:42,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-07 01:03:42,492 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:03:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -579575509, now seen corresponding path program 5 times [2021-11-07 01:03:42,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:42,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992573485] [2021-11-07 01:03:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:42,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:43,332 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:43,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992573485] [2021-11-07 01:03:43,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992573485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:43,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:43,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:03:43,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209705592] [2021-11-07 01:03:43,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:03:43,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:03:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:03:43,334 INFO L87 Difference]: Start difference. First operand 2357 states and 5352 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:45,892 INFO L93 Difference]: Finished difference Result 2649 states and 5937 transitions. [2021-11-07 01:03:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:03:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:45,896 INFO L225 Difference]: With dead ends: 2649 [2021-11-07 01:03:45,896 INFO L226 Difference]: Without dead ends: 2597 [2021-11-07 01:03:45,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:03:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2021-11-07 01:03:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2369. [2021-11-07 01:03:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2359 states have (on average 2.27893175074184) internal successors, (5376), 2368 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 5376 transitions. [2021-11-07 01:03:45,934 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 5376 transitions. Word has length 23 [2021-11-07 01:03:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:45,935 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 5376 transitions. [2021-11-07 01:03:45,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 5376 transitions. [2021-11-07 01:03:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:03:45,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:45,936 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:45,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-11-07 01:03:45,937 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:03:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -559891357, now seen corresponding path program 6 times [2021-11-07 01:03:45,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:45,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299804149] [2021-11-07 01:03:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:45,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:46,300 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:46,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299804149] [2021-11-07 01:03:46,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299804149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:46,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:46,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 01:03:46,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870636336] [2021-11-07 01:03:46,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:03:46,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:46,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:03:46,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:03:46,301 INFO L87 Difference]: Start difference. First operand 2369 states and 5376 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:49,548 INFO L93 Difference]: Finished difference Result 3415 states and 7629 transitions. [2021-11-07 01:03:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 01:03:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:49,552 INFO L225 Difference]: With dead ends: 3415 [2021-11-07 01:03:49,553 INFO L226 Difference]: Without dead ends: 3363 [2021-11-07 01:03:49,553 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:03:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2021-11-07 01:03:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 2353. [2021-11-07 01:03:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2343 states have (on average 2.2799829278702517) internal successors, (5342), 2352 states have internal predecessors, (5342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 5342 transitions. [2021-11-07 01:03:49,585 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 5342 transitions. Word has length 23 [2021-11-07 01:03:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:49,585 INFO L470 AbstractCegarLoop]: Abstraction has 2353 states and 5342 transitions. [2021-11-07 01:03:49,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 5342 transitions. [2021-11-07 01:03:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:03:49,586 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:49,586 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:49,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-11-07 01:03:49,587 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:03:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1928845699, now seen corresponding path program 7 times [2021-11-07 01:03:49,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:49,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832379703] [2021-11-07 01:03:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:49,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:50,260 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:50,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832379703] [2021-11-07 01:03:50,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832379703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:50,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:50,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 01:03:50,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704957930] [2021-11-07 01:03:50,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:03:50,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:03:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:03:50,261 INFO L87 Difference]: Start difference. First operand 2353 states and 5342 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:52,880 INFO L93 Difference]: Finished difference Result 2670 states and 5975 transitions. [2021-11-07 01:03:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:03:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:52,883 INFO L225 Difference]: With dead ends: 2670 [2021-11-07 01:03:52,883 INFO L226 Difference]: Without dead ends: 2618 [2021-11-07 01:03:52,884 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:03:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-11-07 01:03:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2367. [2021-11-07 01:03:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 2357 states have (on average 2.2791684344505727) internal successors, (5372), 2366 states have internal predecessors, (5372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 5372 transitions. [2021-11-07 01:03:52,913 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 5372 transitions. Word has length 23 [2021-11-07 01:03:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:52,914 INFO L470 AbstractCegarLoop]: Abstraction has 2367 states and 5372 transitions. [2021-11-07 01:03:52,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 5372 transitions. [2021-11-07 01:03:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:03:52,915 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:52,915 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:52,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-11-07 01:03:52,915 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:03:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash -442061899, now seen corresponding path program 8 times [2021-11-07 01:03:52,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:52,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654134457] [2021-11-07 01:03:52,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:52,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:53,911 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:53,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654134457] [2021-11-07 01:03:53,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654134457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:53,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:53,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:03:53,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221885803] [2021-11-07 01:03:53,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:03:53,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:03:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:03:53,912 INFO L87 Difference]: Start difference. First operand 2367 states and 5372 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:56,326 INFO L93 Difference]: Finished difference Result 2695 states and 6029 transitions. [2021-11-07 01:03:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:03:56,326 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:56,329 INFO L225 Difference]: With dead ends: 2695 [2021-11-07 01:03:56,329 INFO L226 Difference]: Without dead ends: 2643 [2021-11-07 01:03:56,330 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:03:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2021-11-07 01:03:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2379. [2021-11-07 01:03:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2369 states have (on average 2.2777543267201352) internal successors, (5396), 2378 states have internal predecessors, (5396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 5396 transitions. [2021-11-07 01:03:56,357 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 5396 transitions. Word has length 23 [2021-11-07 01:03:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:56,357 INFO L470 AbstractCegarLoop]: Abstraction has 2379 states and 5396 transitions. [2021-11-07 01:03:56,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 5396 transitions. [2021-11-07 01:03:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:03:56,358 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:56,358 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:56,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-11-07 01:03:56,359 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:03:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1625239949, now seen corresponding path program 9 times [2021-11-07 01:03:56,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:56,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805780026] [2021-11-07 01:03:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:56,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:57,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:57,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805780026] [2021-11-07 01:03:57,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805780026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:57,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:57,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:03:57,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351508254] [2021-11-07 01:03:57,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:03:57,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:57,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:03:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:03:57,180 INFO L87 Difference]: Start difference. First operand 2379 states and 5396 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:59,995 INFO L93 Difference]: Finished difference Result 2733 states and 6118 transitions. [2021-11-07 01:03:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:03:59,996 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:03:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:59,999 INFO L225 Difference]: With dead ends: 2733 [2021-11-07 01:03:59,999 INFO L226 Difference]: Without dead ends: 2681 [2021-11-07 01:03:59,999 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:04:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2021-11-07 01:04:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2385. [2021-11-07 01:04:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2375 states have (on average 2.277052631578947) internal successors, (5408), 2384 states have internal predecessors, (5408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 5408 transitions. [2021-11-07 01:04:00,029 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 5408 transitions. Word has length 23 [2021-11-07 01:04:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:00,029 INFO L470 AbstractCegarLoop]: Abstraction has 2385 states and 5408 transitions. [2021-11-07 01:04:00,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 5408 transitions. [2021-11-07 01:04:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:00,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:00,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:00,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-11-07 01:04:00,030 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 838902873, now seen corresponding path program 10 times [2021-11-07 01:04:00,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:00,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686024316] [2021-11-07 01:04:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:00,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:00,835 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:00,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686024316] [2021-11-07 01:04:00,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686024316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:00,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:00,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:04:00,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001925109] [2021-11-07 01:04:00,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:04:00,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:04:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:04:00,837 INFO L87 Difference]: Start difference. First operand 2385 states and 5408 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:03,653 INFO L93 Difference]: Finished difference Result 2677 states and 5993 transitions. [2021-11-07 01:04:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:04:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:03,656 INFO L225 Difference]: With dead ends: 2677 [2021-11-07 01:04:03,656 INFO L226 Difference]: Without dead ends: 2625 [2021-11-07 01:04:03,657 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:04:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2021-11-07 01:04:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2397. [2021-11-07 01:04:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2387 states have (on average 2.275659824046921) internal successors, (5432), 2396 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 5432 transitions. [2021-11-07 01:04:03,692 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 5432 transitions. Word has length 23 [2021-11-07 01:04:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:03,693 INFO L470 AbstractCegarLoop]: Abstraction has 2397 states and 5432 transitions. [2021-11-07 01:04:03,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 5432 transitions. [2021-11-07 01:04:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:03,694 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:03,694 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:03,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-11-07 01:04:03,694 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash 858587025, now seen corresponding path program 11 times [2021-11-07 01:04:03,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:03,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416083917] [2021-11-07 01:04:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:03,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:04,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:04,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416083917] [2021-11-07 01:04:04,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416083917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:04,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:04,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 01:04:04,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076374073] [2021-11-07 01:04:04,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:04:04,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:04:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:04:04,129 INFO L87 Difference]: Start difference. First operand 2397 states and 5432 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:07,390 INFO L93 Difference]: Finished difference Result 3443 states and 7685 transitions. [2021-11-07 01:04:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 01:04:07,390 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:07,394 INFO L225 Difference]: With dead ends: 3443 [2021-11-07 01:04:07,394 INFO L226 Difference]: Without dead ends: 3391 [2021-11-07 01:04:07,395 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:04:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2021-11-07 01:04:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2360. [2021-11-07 01:04:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2350 states have (on average 2.2791489361702126) internal successors, (5356), 2359 states have internal predecessors, (5356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 5356 transitions. [2021-11-07 01:04:07,452 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 5356 transitions. Word has length 23 [2021-11-07 01:04:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:07,452 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 5356 transitions. [2021-11-07 01:04:07,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 5356 transitions. [2021-11-07 01:04:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:07,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:07,453 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:07,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-11-07 01:04:07,453 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:07,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:07,454 INFO L85 PathProgramCache]: Analyzing trace with hash -365191921, now seen corresponding path program 12 times [2021-11-07 01:04:07,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:07,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610883473] [2021-11-07 01:04:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:07,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:08,145 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:08,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610883473] [2021-11-07 01:04:08,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610883473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:08,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:08,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 01:04:08,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981529716] [2021-11-07 01:04:08,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:04:08,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:04:08,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:04:08,147 INFO L87 Difference]: Start difference. First operand 2360 states and 5356 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:10,732 INFO L93 Difference]: Finished difference Result 2665 states and 5965 transitions. [2021-11-07 01:04:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:04:10,732 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:10,737 INFO L225 Difference]: With dead ends: 2665 [2021-11-07 01:04:10,737 INFO L226 Difference]: Without dead ends: 2613 [2021-11-07 01:04:10,738 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:04:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2021-11-07 01:04:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2368. [2021-11-07 01:04:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2358 states have (on average 2.279050042408821) internal successors, (5374), 2367 states have internal predecessors, (5374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 5374 transitions. [2021-11-07 01:04:10,766 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 5374 transitions. Word has length 23 [2021-11-07 01:04:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:10,766 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 5374 transitions. [2021-11-07 01:04:10,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 5374 transitions. [2021-11-07 01:04:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:10,767 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:10,767 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:10,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-11-07 01:04:10,767 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1121591879, now seen corresponding path program 13 times [2021-11-07 01:04:10,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:10,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281756188] [2021-11-07 01:04:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:10,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:11,662 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:11,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281756188] [2021-11-07 01:04:11,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281756188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:11,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:11,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:04:11,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82102935] [2021-11-07 01:04:11,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:04:11,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:04:11,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:04:11,663 INFO L87 Difference]: Start difference. First operand 2368 states and 5374 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:14,540 INFO L93 Difference]: Finished difference Result 2663 states and 5965 transitions. [2021-11-07 01:04:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:04:14,541 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:14,543 INFO L225 Difference]: With dead ends: 2663 [2021-11-07 01:04:14,543 INFO L226 Difference]: Without dead ends: 2611 [2021-11-07 01:04:14,543 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:04:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2021-11-07 01:04:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2368. [2021-11-07 01:04:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2358 states have (on average 2.279050042408821) internal successors, (5374), 2367 states have internal predecessors, (5374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 5374 transitions. [2021-11-07 01:04:14,570 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 5374 transitions. Word has length 23 [2021-11-07 01:04:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:14,570 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 5374 transitions. [2021-11-07 01:04:14,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 5374 transitions. [2021-11-07 01:04:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:14,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:14,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:14,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-11-07 01:04:14,572 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1106073569, now seen corresponding path program 14 times [2021-11-07 01:04:14,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:14,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720090722] [2021-11-07 01:04:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:14,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:15,433 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:15,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720090722] [2021-11-07 01:04:15,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720090722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:15,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:15,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:04:15,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069133278] [2021-11-07 01:04:15,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:04:15,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:04:15,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:04:15,434 INFO L87 Difference]: Start difference. First operand 2368 states and 5374 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:18,735 INFO L93 Difference]: Finished difference Result 2704 states and 6060 transitions. [2021-11-07 01:04:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:04:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:18,738 INFO L225 Difference]: With dead ends: 2704 [2021-11-07 01:04:18,738 INFO L226 Difference]: Without dead ends: 2652 [2021-11-07 01:04:18,739 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:04:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2021-11-07 01:04:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2368. [2021-11-07 01:04:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2358 states have (on average 2.279050042408821) internal successors, (5374), 2367 states have internal predecessors, (5374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 5374 transitions. [2021-11-07 01:04:18,771 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 5374 transitions. Word has length 23 [2021-11-07 01:04:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:18,772 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 5374 transitions. [2021-11-07 01:04:18,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 5374 transitions. [2021-11-07 01:04:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:18,773 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:18,773 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:18,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-11-07 01:04:18,773 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1892410645, now seen corresponding path program 15 times [2021-11-07 01:04:18,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:18,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363173673] [2021-11-07 01:04:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:18,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:19,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:19,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363173673] [2021-11-07 01:04:19,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363173673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:19,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:19,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:04:19,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495247946] [2021-11-07 01:04:19,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:04:19,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:04:19,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:04:19,628 INFO L87 Difference]: Start difference. First operand 2368 states and 5374 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:22,691 INFO L93 Difference]: Finished difference Result 2648 states and 5935 transitions. [2021-11-07 01:04:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:04:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:22,695 INFO L225 Difference]: With dead ends: 2648 [2021-11-07 01:04:22,695 INFO L226 Difference]: Without dead ends: 2596 [2021-11-07 01:04:22,695 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:04:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2021-11-07 01:04:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2368. [2021-11-07 01:04:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2358 states have (on average 2.279050042408821) internal successors, (5374), 2367 states have internal predecessors, (5374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 5374 transitions. [2021-11-07 01:04:22,727 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 5374 transitions. Word has length 23 [2021-11-07 01:04:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:22,727 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 5374 transitions. [2021-11-07 01:04:22,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 5374 transitions. [2021-11-07 01:04:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:22,729 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:22,729 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:22,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-11-07 01:04:22,729 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1872726493, now seen corresponding path program 16 times [2021-11-07 01:04:22,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:22,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593336221] [2021-11-07 01:04:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:22,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:23,099 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:23,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593336221] [2021-11-07 01:04:23,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593336221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:23,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:23,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 01:04:23,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096531331] [2021-11-07 01:04:23,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:04:23,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:04:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:04:23,100 INFO L87 Difference]: Start difference. First operand 2368 states and 5374 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:26,773 INFO L93 Difference]: Finished difference Result 3400 states and 7597 transitions. [2021-11-07 01:04:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 01:04:26,773 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:26,801 INFO L225 Difference]: With dead ends: 3400 [2021-11-07 01:04:26,801 INFO L226 Difference]: Without dead ends: 3348 [2021-11-07 01:04:26,801 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:04:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2021-11-07 01:04:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 2310. [2021-11-07 01:04:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2300 states have (on average 2.2843478260869565) internal successors, (5254), 2309 states have internal predecessors, (5254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 5254 transitions. [2021-11-07 01:04:26,836 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 5254 transitions. Word has length 23 [2021-11-07 01:04:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:26,836 INFO L470 AbstractCegarLoop]: Abstraction has 2310 states and 5254 transitions. [2021-11-07 01:04:26,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 5254 transitions. [2021-11-07 01:04:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:04:26,837 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:26,837 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:26,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-11-07 01:04:26,837 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2140401073, now seen corresponding path program 17 times [2021-11-07 01:04:26,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:26,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158844801] [2021-11-07 01:04:26,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:26,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:27,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:27,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158844801] [2021-11-07 01:04:27,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158844801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:27,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:27,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 01:04:27,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042742239] [2021-11-07 01:04:27,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:04:27,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:04:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:04:27,678 INFO L87 Difference]: Start difference. First operand 2310 states and 5254 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:30,386 INFO L93 Difference]: Finished difference Result 2591 states and 5816 transitions. [2021-11-07 01:04:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:04:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:04:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:30,390 INFO L225 Difference]: With dead ends: 2591 [2021-11-07 01:04:30,390 INFO L226 Difference]: Without dead ends: 2539 [2021-11-07 01:04:30,390 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:04:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2021-11-07 01:04:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2289. [2021-11-07 01:04:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2289 states, 2279 states have (on average 2.2838964458095656) internal successors, (5205), 2288 states have internal predecessors, (5205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 5205 transitions. [2021-11-07 01:04:30,420 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 5205 transitions. Word has length 23 [2021-11-07 01:04:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:30,420 INFO L470 AbstractCegarLoop]: Abstraction has 2289 states and 5205 transitions. [2021-11-07 01:04:30,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 5205 transitions. [2021-11-07 01:04:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:04:30,421 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:30,421 INFO L513 BasicCegarLoop]: trace 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] [2021-11-07 01:04:30,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-11-07 01:04:30,422 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash -476372603, now seen corresponding path program 1 times [2021-11-07 01:04:30,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:30,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928816529] [2021-11-07 01:04:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:30,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:30,741 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:30,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928816529] [2021-11-07 01:04:30,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928816529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:30,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:30,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:04:30,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426521765] [2021-11-07 01:04:30,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:04:30,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:30,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:04:30,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:04:30,742 INFO L87 Difference]: Start difference. First operand 2289 states and 5205 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:32,103 INFO L93 Difference]: Finished difference Result 2394 states and 5427 transitions. [2021-11-07 01:04:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:04:32,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:04:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:32,106 INFO L225 Difference]: With dead ends: 2394 [2021-11-07 01:04:32,107 INFO L226 Difference]: Without dead ends: 2394 [2021-11-07 01:04:32,107 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-11-07 01:04:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2021-11-07 01:04:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2298. [2021-11-07 01:04:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 2288 states have (on average 2.2827797202797204) internal successors, (5223), 2297 states have internal predecessors, (5223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 5223 transitions. [2021-11-07 01:04:32,136 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 5223 transitions. Word has length 24 [2021-11-07 01:04:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:32,136 INFO L470 AbstractCegarLoop]: Abstraction has 2298 states and 5223 transitions. [2021-11-07 01:04:32,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 5223 transitions. [2021-11-07 01:04:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:04:32,137 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:32,137 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:32,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-11-07 01:04:32,137 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1520731892, now seen corresponding path program 2 times [2021-11-07 01:04:32,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:32,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045482270] [2021-11-07 01:04:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:32,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:32,432 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:32,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045482270] [2021-11-07 01:04:32,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045482270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:32,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:32,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 01:04:32,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723352343] [2021-11-07 01:04:32,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 01:04:32,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 01:04:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:04:32,433 INFO L87 Difference]: Start difference. First operand 2298 states and 5223 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:33,582 INFO L93 Difference]: Finished difference Result 2473 states and 5569 transitions. [2021-11-07 01:04:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:04:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:04:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:33,585 INFO L225 Difference]: With dead ends: 2473 [2021-11-07 01:04:33,585 INFO L226 Difference]: Without dead ends: 2473 [2021-11-07 01:04:33,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:04:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2021-11-07 01:04:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2341. [2021-11-07 01:04:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 2330 states have (on average 2.2699570815450643) internal successors, (5289), 2340 states have internal predecessors, (5289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5289 transitions. [2021-11-07 01:04:33,616 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5289 transitions. Word has length 24 [2021-11-07 01:04:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:33,616 INFO L470 AbstractCegarLoop]: Abstraction has 2341 states and 5289 transitions. [2021-11-07 01:04:33,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5289 transitions. [2021-11-07 01:04:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:04:33,617 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:33,617 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:33,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-11-07 01:04:33,617 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-07 01:04:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 782567052, now seen corresponding path program 3 times [2021-11-07 01:04:33,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:33,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027479991] [2021-11-07 01:04:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:33,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:33,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:33,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027479991] [2021-11-07 01:04:33,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027479991] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:04:33,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56872496] [2021-11-07 01:04:33,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:04:33,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:04:33,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:04:33,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:04:33,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df469578-4400-4d2e-a0a9-372c85df6560/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:04:34,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:04:34,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:04:34,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-07 01:04:34,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:34,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:04:35,244 INFO L354 Elim1Store]: treesize reduction 480, result has 20.3 percent of original size [2021-11-07 01:04:35,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 268 treesize of output 276 [2021-11-07 01:04:35,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:04:35,469 INFO L354 Elim1Store]: treesize reduction 482, result has 20.7 percent of original size [2021-11-07 01:04:35,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 273 treesize of output 269 [2021-11-07 01:04:35,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 291 [2021-11-07 01:05:21,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:05:21,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:05:21,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:05:21,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 01:05:21,642 INFO L354 Elim1Store]: treesize reduction 194, result has 60.2 percent of original size [2021-11-07 01:05:21,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 10 disjoint index pairs (out of 66 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 349 treesize of output 571 [2021-11-07 01:05:21,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:05:21,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:05:21,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:05:21,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 01:05:22,175 INFO L354 Elim1Store]: treesize reduction 194, result has 60.2 percent of original size [2021-11-07 01:05:22,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 10 disjoint index pairs (out of 66 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 571 treesize of output 757