java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 05:03:14,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 05:03:14,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 05:03:14,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 05:03:14,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 05:03:14,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 05:03:14,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 05:03:14,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 05:03:14,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 05:03:14,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 05:03:14,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 05:03:14,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 05:03:14,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 05:03:14,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 05:03:14,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 05:03:14,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 05:03:14,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 05:03:14,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 05:03:14,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 05:03:14,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 05:03:14,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 05:03:14,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 05:03:14,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 05:03:14,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 05:03:14,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 05:03:14,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 05:03:14,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 05:03:14,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 05:03:14,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 05:03:14,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 05:03:14,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 05:03:14,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 05:03:14,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 05:03:14,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 05:03:14,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 05:03:14,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 05:03:14,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 05:03:14,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 05:03:14,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 05:03:14,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 05:03:14,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 05:03:14,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 05:03:14,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 05:03:14,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 05:03:14,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 05:03:14,396 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 05:03:14,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 05:03:14,397 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 05:03:14,397 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 05:03:14,397 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 05:03:14,398 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 05:03:14,398 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 05:03:14,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 05:03:14,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 05:03:14,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 05:03:14,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 05:03:14,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 05:03:14,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 05:03:14,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 05:03:14,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 05:03:14,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 05:03:14,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 05:03:14,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 05:03:14,403 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 05:03:14,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 05:03:14,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 05:03:14,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 05:03:14,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 05:03:14,404 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 05:03:14,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 05:03:14,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 05:03:14,404 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 05:03:14,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 05:03:14,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 05:03:14,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 05:03:14,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 05:03:14,465 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 05:03:14,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-10 05:03:14,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b387918/af025fd142874c19933fef96eec8be09/FLAGadce6c520 [2019-09-10 05:03:15,100 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 05:03:15,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-10 05:03:15,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b387918/af025fd142874c19933fef96eec8be09/FLAGadce6c520 [2019-09-10 05:03:15,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b387918/af025fd142874c19933fef96eec8be09 [2019-09-10 05:03:15,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 05:03:15,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 05:03:15,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 05:03:15,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 05:03:15,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 05:03:15,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:03:15" (1/1) ... [2019-09-10 05:03:15,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d752d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:15, skipping insertion in model container [2019-09-10 05:03:15,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:03:15" (1/1) ... [2019-09-10 05:03:15,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 05:03:15,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 05:03:16,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:03:16,097 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 05:03:16,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:03:16,276 INFO L192 MainTranslator]: Completed translation [2019-09-10 05:03:16,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16 WrapperNode [2019-09-10 05:03:16,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 05:03:16,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 05:03:16,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 05:03:16,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 05:03:16,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... [2019-09-10 05:03:16,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... [2019-09-10 05:03:16,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... [2019-09-10 05:03:16,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... [2019-09-10 05:03:16,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... [2019-09-10 05:03:16,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... [2019-09-10 05:03:16,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... [2019-09-10 05:03:16,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 05:03:16,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 05:03:16,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 05:03:16,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 05:03:16,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 05:03:16,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 05:03:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 05:03:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 05:03:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 05:03:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 05:03:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 05:03:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 05:03:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 05:03:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 05:03:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 05:03:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 05:03:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 05:03:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 05:03:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 05:03:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 05:03:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 05:03:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 05:03:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 05:03:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 05:03:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 05:03:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 05:03:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 05:03:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 05:03:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 05:03:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 05:03:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 05:03:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 05:03:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 05:03:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 05:03:18,916 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 05:03:18,916 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 05:03:18,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:03:18 BoogieIcfgContainer [2019-09-10 05:03:18,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 05:03:18,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 05:03:18,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 05:03:18,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 05:03:18,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 05:03:15" (1/3) ... [2019-09-10 05:03:18,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76faf2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:03:18, skipping insertion in model container [2019-09-10 05:03:18,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:03:16" (2/3) ... [2019-09-10 05:03:18,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76faf2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:03:18, skipping insertion in model container [2019-09-10 05:03:18,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:03:18" (3/3) ... [2019-09-10 05:03:18,925 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-10 05:03:18,934 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 05:03:18,941 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 05:03:18,957 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 05:03:18,983 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 05:03:18,983 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 05:03:18,983 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 05:03:18,983 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 05:03:18,983 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 05:03:18,984 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 05:03:18,984 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 05:03:18,984 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 05:03:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states. [2019-09-10 05:03:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 05:03:19,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:19,062 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:03:19,064 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1090629948, now seen corresponding path program 1 times [2019-09-10 05:03:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:19,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:19,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:03:19,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:19,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:03:19,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:19,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:03:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:03:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:03:19,812 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 5 states. [2019-09-10 05:03:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:20,181 INFO L93 Difference]: Finished difference Result 775 states and 1398 transitions. [2019-09-10 05:03:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 05:03:20,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-10 05:03:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:20,209 INFO L225 Difference]: With dead ends: 775 [2019-09-10 05:03:20,209 INFO L226 Difference]: Without dead ends: 771 [2019-09-10 05:03:20,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:03:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-10 05:03:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2019-09-10 05:03:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-10 05:03:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1330 transitions. [2019-09-10 05:03:20,299 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1330 transitions. Word has length 181 [2019-09-10 05:03:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:20,300 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 1330 transitions. [2019-09-10 05:03:20,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:03:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1330 transitions. [2019-09-10 05:03:20,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 05:03:20,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:20,307 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:03:20,308 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1965304482, now seen corresponding path program 1 times [2019-09-10 05:03:20,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:20,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:20,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:03:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:21,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:03:21,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:21,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:03:21,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:03:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:03:21,171 INFO L87 Difference]: Start difference. First operand 771 states and 1330 transitions. Second operand 13 states. [2019-09-10 05:03:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:37,671 INFO L93 Difference]: Finished difference Result 3368 states and 5629 transitions. [2019-09-10 05:03:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 05:03:37,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2019-09-10 05:03:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:37,707 INFO L225 Difference]: With dead ends: 3368 [2019-09-10 05:03:37,708 INFO L226 Difference]: Without dead ends: 3368 [2019-09-10 05:03:37,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 05:03:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2019-09-10 05:03:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 1845. [2019-09-10 05:03:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-10 05:03:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 3108 transitions. [2019-09-10 05:03:37,859 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 3108 transitions. Word has length 245 [2019-09-10 05:03:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:37,861 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 3108 transitions. [2019-09-10 05:03:37,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:03:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3108 transitions. [2019-09-10 05:03:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 05:03:37,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:37,868 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:03:37,869 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -274859823, now seen corresponding path program 1 times [2019-09-10 05:03:37,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:37,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:37,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:37,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:03:38,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:38,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:03:38,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:38,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:03:38,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:03:38,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:03:38,159 INFO L87 Difference]: Start difference. First operand 1845 states and 3108 transitions. Second operand 6 states. [2019-09-10 05:03:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:42,768 INFO L93 Difference]: Finished difference Result 3155 states and 5262 transitions. [2019-09-10 05:03:42,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 05:03:42,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-10 05:03:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:42,797 INFO L225 Difference]: With dead ends: 3155 [2019-09-10 05:03:42,797 INFO L226 Difference]: Without dead ends: 3155 [2019-09-10 05:03:42,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:03:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2019-09-10 05:03:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 2934. [2019-09-10 05:03:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-09-10 05:03:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 4901 transitions. [2019-09-10 05:03:42,993 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 4901 transitions. Word has length 246 [2019-09-10 05:03:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:42,994 INFO L475 AbstractCegarLoop]: Abstraction has 2934 states and 4901 transitions. [2019-09-10 05:03:42,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:03:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 4901 transitions. [2019-09-10 05:03:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:03:43,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:43,006 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:03:43,006 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:43,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1052161479, now seen corresponding path program 1 times [2019-09-10 05:03:43,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:43,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:43,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:03:43,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:43,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:03:43,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:43,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:03:43,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:03:43,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:03:43,317 INFO L87 Difference]: Start difference. First operand 2934 states and 4901 transitions. Second operand 6 states. [2019-09-10 05:03:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:46,709 INFO L93 Difference]: Finished difference Result 4695 states and 7775 transitions. [2019-09-10 05:03:46,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 05:03:46,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-10 05:03:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:46,733 INFO L225 Difference]: With dead ends: 4695 [2019-09-10 05:03:46,733 INFO L226 Difference]: Without dead ends: 4695 [2019-09-10 05:03:46,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 05:03:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2019-09-10 05:03:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4672. [2019-09-10 05:03:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4672 states. [2019-09-10 05:03:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 7747 transitions. [2019-09-10 05:03:46,861 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 7747 transitions. Word has length 247 [2019-09-10 05:03:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:46,861 INFO L475 AbstractCegarLoop]: Abstraction has 4672 states and 7747 transitions. [2019-09-10 05:03:46,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:03:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 7747 transitions. [2019-09-10 05:03:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 05:03:46,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:46,870 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:03:46,870 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 569606024, now seen corresponding path program 1 times [2019-09-10 05:03:46,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:46,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:46,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:03:47,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:47,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:03:47,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:47,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:03:47,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:03:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:03:47,150 INFO L87 Difference]: Start difference. First operand 4672 states and 7747 transitions. Second operand 6 states. [2019-09-10 05:03:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:52,600 INFO L93 Difference]: Finished difference Result 20901 states and 34362 transitions. [2019-09-10 05:03:52,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:03:52,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-10 05:03:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:52,709 INFO L225 Difference]: With dead ends: 20901 [2019-09-10 05:03:52,710 INFO L226 Difference]: Without dead ends: 20901 [2019-09-10 05:03:52,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:03:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2019-09-10 05:03:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 20855. [2019-09-10 05:03:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20855 states. [2019-09-10 05:03:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20855 states to 20855 states and 34282 transitions. [2019-09-10 05:03:53,192 INFO L78 Accepts]: Start accepts. Automaton has 20855 states and 34282 transitions. Word has length 248 [2019-09-10 05:03:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:53,193 INFO L475 AbstractCegarLoop]: Abstraction has 20855 states and 34282 transitions. [2019-09-10 05:03:53,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:03:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 20855 states and 34282 transitions. [2019-09-10 05:03:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:03:53,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:53,204 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:03:53,204 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:53,204 INFO L82 PathProgramCache]: Analyzing trace with hash -746893872, now seen corresponding path program 1 times [2019-09-10 05:03:53,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:53,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:53,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:53,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:03:53,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:53,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:03:53,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:53,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:03:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:03:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:03:53,548 INFO L87 Difference]: Start difference. First operand 20855 states and 34282 transitions. Second operand 6 states. [2019-09-10 05:03:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:59,079 INFO L93 Difference]: Finished difference Result 101582 states and 166587 transitions. [2019-09-10 05:03:59,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:03:59,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 05:03:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:59,482 INFO L225 Difference]: With dead ends: 101582 [2019-09-10 05:03:59,482 INFO L226 Difference]: Without dead ends: 101582 [2019-09-10 05:03:59,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:03:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101582 states. [2019-09-10 05:04:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101582 to 101384. [2019-09-10 05:04:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101384 states. [2019-09-10 05:04:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101384 states to 101384 states and 166203 transitions. [2019-09-10 05:04:02,745 INFO L78 Accepts]: Start accepts. Automaton has 101384 states and 166203 transitions. Word has length 249 [2019-09-10 05:04:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:04:02,746 INFO L475 AbstractCegarLoop]: Abstraction has 101384 states and 166203 transitions. [2019-09-10 05:04:02,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:04:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 101384 states and 166203 transitions. [2019-09-10 05:04:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 05:04:02,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:02,758 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:04:02,758 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:02,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1339597375, now seen corresponding path program 1 times [2019-09-10 05:04:02,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:02,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:02,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:02,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:02,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:04:02,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:02,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:04:02,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:02,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:04:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:04:02,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:04:02,992 INFO L87 Difference]: Start difference. First operand 101384 states and 166203 transitions. Second operand 6 states. [2019-09-10 05:04:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:04:13,887 INFO L93 Difference]: Finished difference Result 447821 states and 733079 transitions. [2019-09-10 05:04:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:04:13,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-09-10 05:04:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:15,260 INFO L225 Difference]: With dead ends: 447821 [2019-09-10 05:04:15,260 INFO L226 Difference]: Without dead ends: 447821 [2019-09-10 05:04:15,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:04:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447821 states. [2019-09-10 05:04:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447821 to 446872. [2019-09-10 05:04:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446872 states. [2019-09-10 05:04:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446872 states to 446872 states and 731274 transitions. [2019-09-10 05:04:33,747 INFO L78 Accepts]: Start accepts. Automaton has 446872 states and 731274 transitions. Word has length 250 [2019-09-10 05:04:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:04:33,748 INFO L475 AbstractCegarLoop]: Abstraction has 446872 states and 731274 transitions. [2019-09-10 05:04:33,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:04:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 446872 states and 731274 transitions. [2019-09-10 05:04:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 05:04:33,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:33,760 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:04:33,760 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2033618999, now seen corresponding path program 1 times [2019-09-10 05:04:33,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:33,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:33,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:04:33,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:33,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 05:04:33,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:33,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 05:04:33,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 05:04:33,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 05:04:33,923 INFO L87 Difference]: Start difference. First operand 446872 states and 731274 transitions. Second operand 4 states. [2019-09-10 05:04:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:04:40,173 INFO L93 Difference]: Finished difference Result 1201383 states and 1961488 transitions. [2019-09-10 05:04:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 05:04:40,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-09-10 05:04:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:54,415 INFO L225 Difference]: With dead ends: 1201383 [2019-09-10 05:04:54,415 INFO L226 Difference]: Without dead ends: 1201383 [2019-09-10 05:04:54,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 05:04:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201383 states. [2019-09-10 05:05:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201383 to 1195156. [2019-09-10 05:05:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195156 states. [2019-09-10 05:05:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195156 states to 1195156 states and 1953204 transitions. [2019-09-10 05:05:49,978 INFO L78 Accepts]: Start accepts. Automaton has 1195156 states and 1953204 transitions. Word has length 252 [2019-09-10 05:05:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:49,978 INFO L475 AbstractCegarLoop]: Abstraction has 1195156 states and 1953204 transitions. [2019-09-10 05:05:49,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 05:05:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1195156 states and 1953204 transitions. [2019-09-10 05:05:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 05:05:49,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:49,990 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:05:49,990 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash 873683357, now seen corresponding path program 1 times [2019-09-10 05:05:49,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:49,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:49,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:05:50,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:50,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:05:50,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:50,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:05:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:05:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:05:50,397 INFO L87 Difference]: Start difference. First operand 1195156 states and 1953204 transitions. Second operand 13 states. [2019-09-10 05:06:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:06:39,470 INFO L93 Difference]: Finished difference Result 1819403 states and 2978387 transitions. [2019-09-10 05:06:39,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 05:06:39,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 253 [2019-09-10 05:06:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:06:45,626 INFO L225 Difference]: With dead ends: 1819403 [2019-09-10 05:06:45,627 INFO L226 Difference]: Without dead ends: 1819403 [2019-09-10 05:06:45,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=985, Invalid=3985, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 05:06:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819403 states.