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_lcr.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:34:02,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:34:02,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:34:02,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:34:02,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:34:02,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:34:02,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:34:02,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:34:02,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:34:02,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:34:02,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:34:02,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:34:02,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:34:02,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:34:02,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:34:02,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:34:02,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:34:02,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:34:02,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:34:02,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:34:02,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:34:02,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:34:02,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:34:02,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:34:02,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:34:02,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:34:02,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:34:02,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:34:02,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:34:02,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:34:02,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:34:02,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:34:02,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:34:02,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:34:02,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:34:02,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:34:02,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:34:02,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:34:02,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:34:02,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:34:02,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:34:02,561 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 04:34:02,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:34:02,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:34:02,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:34:02,582 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:34:02,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:34:02,583 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:34:02,583 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:34:02,583 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:34:02,583 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:34:02,583 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:34:02,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:34:02,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:34:02,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:34:02,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:34:02,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:34:02,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:34:02,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:34:02,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:34:02,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:34:02,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:34:02,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:34:02,586 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:34:02,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:34:02,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:34:02,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:34:02,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:34:02,587 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:34:02,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:34:02,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:34:02,588 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:34:02,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:34:02,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:34:02,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:34:02,633 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:34:02,633 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:34:02,634 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2019-09-10 04:34:02,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772a9c3c5/11066300743f4e26838df6a0de1b0312/FLAGb3c387561 [2019-09-10 04:34:03,201 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:34:03,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2019-09-10 04:34:03,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772a9c3c5/11066300743f4e26838df6a0de1b0312/FLAGb3c387561 [2019-09-10 04:34:03,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772a9c3c5/11066300743f4e26838df6a0de1b0312 [2019-09-10 04:34:03,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:34:03,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:34:03,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:34:03,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:34:03,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:34:03,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:34:03" (1/1) ... [2019-09-10 04:34:03,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff1afcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:03, skipping insertion in model container [2019-09-10 04:34:03,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:34:03" (1/1) ... [2019-09-10 04:34:03,599 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:34:03,637 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:34:03,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:34:03,983 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:34:04,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:34:04,071 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:34:04,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04 WrapperNode [2019-09-10 04:34:04,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:34:04,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:34:04,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:34:04,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:34:04,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (1/1) ... [2019-09-10 04:34:04,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (1/1) ... [2019-09-10 04:34:04,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (1/1) ... [2019-09-10 04:34:04,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (1/1) ... [2019-09-10 04:34:04,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (1/1) ... [2019-09-10 04:34:04,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (1/1) ... [2019-09-10 04:34:04,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (1/1) ... [2019-09-10 04:34:04,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:34:04,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:34:04,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:34:04,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:34:04,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (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 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:34:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:34:04,206 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:34:04,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:34:04,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:34:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:34:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:34:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:34:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:34:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:34:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:34:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:34:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:34:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:34:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:34:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:34:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:34:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:34:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:34:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:34:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:34:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:34:04,918 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:34:04,919 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:34:04,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:34:04 BoogieIcfgContainer [2019-09-10 04:34:04,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:34:04,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:34:04,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:34:04,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:34:04,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:34:03" (1/3) ... [2019-09-10 04:34:04,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456f1667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:34:04, skipping insertion in model container [2019-09-10 04:34:04,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:04" (2/3) ... [2019-09-10 04:34:04,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456f1667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:34:04, skipping insertion in model container [2019-09-10 04:34:04,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:34:04" (3/3) ... [2019-09-10 04:34:04,932 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c [2019-09-10 04:34:04,942 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:34:04,952 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:34:04,969 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:34:04,997 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:34:04,998 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:34:04,998 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:34:04,998 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:34:04,998 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:34:04,999 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:34:04,999 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:34:04,999 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:34:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-09-10 04:34:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 04:34:05,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:05,036 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] [2019-09-10 04:34:05,039 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:05,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:05,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1120943023, now seen corresponding path program 1 times [2019-09-10 04:34:05,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:05,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:05,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:05,442 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 04:34:05,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:05,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:05,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:05,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:05,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:05,470 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 5 states. [2019-09-10 04:34:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:05,630 INFO L93 Difference]: Finished difference Result 128 states and 188 transitions. [2019-09-10 04:34:05,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:34:05,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 04:34:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:05,650 INFO L225 Difference]: With dead ends: 128 [2019-09-10 04:34:05,651 INFO L226 Difference]: Without dead ends: 119 [2019-09-10 04:34:05,655 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 04:34:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-10 04:34:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-09-10 04:34:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-10 04:34:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2019-09-10 04:34:05,726 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 61 [2019-09-10 04:34:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:05,727 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2019-09-10 04:34:05,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2019-09-10 04:34:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 04:34:05,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:05,733 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] [2019-09-10 04:34:05,733 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1805571802, now seen corresponding path program 1 times [2019-09-10 04:34:05,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:05,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:05,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:05,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:05,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:06,193 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 04:34:06,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:34:06,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:06,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:34:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:34:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:34:06,198 INFO L87 Difference]: Start difference. First operand 119 states and 149 transitions. Second operand 13 states. [2019-09-10 04:34:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:10,669 INFO L93 Difference]: Finished difference Result 1089 states and 1540 transitions. [2019-09-10 04:34:10,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 04:34:10,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-10 04:34:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:10,685 INFO L225 Difference]: With dead ends: 1089 [2019-09-10 04:34:10,686 INFO L226 Difference]: Without dead ends: 1089 [2019-09-10 04:34:10,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:34:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-09-10 04:34:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 512. [2019-09-10 04:34:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-10 04:34:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 710 transitions. [2019-09-10 04:34:10,791 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 710 transitions. Word has length 91 [2019-09-10 04:34:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:10,792 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 710 transitions. [2019-09-10 04:34:10,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:34:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 710 transitions. [2019-09-10 04:34:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:10,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:10,798 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] [2019-09-10 04:34:10,798 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2014970142, now seen corresponding path program 1 times [2019-09-10 04:34:10,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:10,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:10,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:10,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:10,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:10,983 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 04:34:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:10,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:10,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:10,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:10,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:10,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:10,994 INFO L87 Difference]: Start difference. First operand 512 states and 710 transitions. Second operand 5 states. [2019-09-10 04:34:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:11,503 INFO L93 Difference]: Finished difference Result 939 states and 1307 transitions. [2019-09-10 04:34:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:34:11,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 04:34:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:11,510 INFO L225 Difference]: With dead ends: 939 [2019-09-10 04:34:11,510 INFO L226 Difference]: Without dead ends: 939 [2019-09-10 04:34:11,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:34:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-09-10 04:34:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 937. [2019-09-10 04:34:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-09-10 04:34:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1306 transitions. [2019-09-10 04:34:11,558 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1306 transitions. Word has length 93 [2019-09-10 04:34:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:11,559 INFO L475 AbstractCegarLoop]: Abstraction has 937 states and 1306 transitions. [2019-09-10 04:34:11,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1306 transitions. [2019-09-10 04:34:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:11,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:11,563 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] [2019-09-10 04:34:11,563 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash 663794708, now seen corresponding path program 1 times [2019-09-10 04:34:11,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:11,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:11,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:11,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:11,679 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 04:34:11,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:11,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:11,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:11,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:11,682 INFO L87 Difference]: Start difference. First operand 937 states and 1306 transitions. Second operand 5 states. [2019-09-10 04:34:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:12,161 INFO L93 Difference]: Finished difference Result 1747 states and 2431 transitions. [2019-09-10 04:34:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:34:12,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 04:34:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:12,173 INFO L225 Difference]: With dead ends: 1747 [2019-09-10 04:34:12,173 INFO L226 Difference]: Without dead ends: 1747 [2019-09-10 04:34:12,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:34:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-09-10 04:34:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1745. [2019-09-10 04:34:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-09-10 04:34:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2430 transitions. [2019-09-10 04:34:12,282 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2430 transitions. Word has length 93 [2019-09-10 04:34:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:12,285 INFO L475 AbstractCegarLoop]: Abstraction has 1745 states and 2430 transitions. [2019-09-10 04:34:12,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2430 transitions. [2019-09-10 04:34:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:12,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:12,294 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] [2019-09-10 04:34:12,294 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1911303562, now seen corresponding path program 1 times [2019-09-10 04:34:12,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:12,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:12,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:12,583 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 04:34:12,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:12,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:34:12,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:12,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:34:12,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:34:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:34:12,585 INFO L87 Difference]: Start difference. First operand 1745 states and 2430 transitions. Second operand 13 states. [2019-09-10 04:34:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:16,795 INFO L93 Difference]: Finished difference Result 4645 states and 6599 transitions. [2019-09-10 04:34:16,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 04:34:16,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 04:34:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:16,822 INFO L225 Difference]: With dead ends: 4645 [2019-09-10 04:34:16,822 INFO L226 Difference]: Without dead ends: 4645 [2019-09-10 04:34:16,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=634, Invalid=2122, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:34:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2019-09-10 04:34:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3949. [2019-09-10 04:34:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2019-09-10 04:34:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5554 transitions. [2019-09-10 04:34:16,971 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5554 transitions. Word has length 93 [2019-09-10 04:34:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:16,971 INFO L475 AbstractCegarLoop]: Abstraction has 3949 states and 5554 transitions. [2019-09-10 04:34:16,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:34:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5554 transitions. [2019-09-10 04:34:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:16,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:16,973 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] [2019-09-10 04:34:16,974 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1095961278, now seen corresponding path program 1 times [2019-09-10 04:34:16,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:16,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:17,080 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 04:34:17,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:17,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:34:17,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:17,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:34:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:34:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:34:17,082 INFO L87 Difference]: Start difference. First operand 3949 states and 5554 transitions. Second operand 6 states. [2019-09-10 04:34:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:17,640 INFO L93 Difference]: Finished difference Result 10931 states and 15354 transitions. [2019-09-10 04:34:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 04:34:17,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 04:34:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:17,750 INFO L225 Difference]: With dead ends: 10931 [2019-09-10 04:34:17,751 INFO L226 Difference]: Without dead ends: 10931 [2019-09-10 04:34:17,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:34:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10931 states. [2019-09-10 04:34:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10931 to 8167. [2019-09-10 04:34:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2019-09-10 04:34:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 11435 transitions. [2019-09-10 04:34:18,163 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 11435 transitions. Word has length 93 [2019-09-10 04:34:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:18,170 INFO L475 AbstractCegarLoop]: Abstraction has 8167 states and 11435 transitions. [2019-09-10 04:34:18,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:34:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 11435 transitions. [2019-09-10 04:34:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:18,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:18,173 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] [2019-09-10 04:34:18,174 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash -737753658, now seen corresponding path program 1 times [2019-09-10 04:34:18,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:18,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:18,360 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 04:34:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:18,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:34:18,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:18,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:34:18,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:34:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:34:18,362 INFO L87 Difference]: Start difference. First operand 8167 states and 11435 transitions. Second operand 9 states. [2019-09-10 04:34:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:19,143 INFO L93 Difference]: Finished difference Result 8915 states and 12212 transitions. [2019-09-10 04:34:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:34:19,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 04:34:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:19,201 INFO L225 Difference]: With dead ends: 8915 [2019-09-10 04:34:19,202 INFO L226 Difference]: Without dead ends: 8915 [2019-09-10 04:34:19,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:34:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2019-09-10 04:34:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 8267. [2019-09-10 04:34:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8267 states. [2019-09-10 04:34:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8267 states to 8267 states and 11564 transitions. [2019-09-10 04:34:19,562 INFO L78 Accepts]: Start accepts. Automaton has 8267 states and 11564 transitions. Word has length 93 [2019-09-10 04:34:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:19,562 INFO L475 AbstractCegarLoop]: Abstraction has 8267 states and 11564 transitions. [2019-09-10 04:34:19,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:34:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 8267 states and 11564 transitions. [2019-09-10 04:34:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:19,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:19,564 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] [2019-09-10 04:34:19,564 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:19,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash -486108610, now seen corresponding path program 1 times [2019-09-10 04:34:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:19,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:19,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:19,706 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 04:34:19,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:19,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:34:19,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:19,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:34:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:34:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:34:19,709 INFO L87 Difference]: Start difference. First operand 8267 states and 11564 transitions. Second operand 9 states. [2019-09-10 04:34:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:20,414 INFO L93 Difference]: Finished difference Result 10210 states and 14083 transitions. [2019-09-10 04:34:20,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:34:20,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 04:34:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:20,464 INFO L225 Difference]: With dead ends: 10210 [2019-09-10 04:34:20,465 INFO L226 Difference]: Without dead ends: 10198 [2019-09-10 04:34:20,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:34:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10198 states. [2019-09-10 04:34:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10198 to 8564. [2019-09-10 04:34:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8564 states. [2019-09-10 04:34:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8564 states to 8564 states and 11981 transitions. [2019-09-10 04:34:20,738 INFO L78 Accepts]: Start accepts. Automaton has 8564 states and 11981 transitions. Word has length 93 [2019-09-10 04:34:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:20,739 INFO L475 AbstractCegarLoop]: Abstraction has 8564 states and 11981 transitions. [2019-09-10 04:34:20,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:34:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8564 states and 11981 transitions. [2019-09-10 04:34:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:20,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:20,741 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] [2019-09-10 04:34:20,741 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1158527038, now seen corresponding path program 1 times [2019-09-10 04:34:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:20,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:20,856 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 04:34:20,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:20,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:34:20,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:20,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:34:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:34:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:34:20,859 INFO L87 Difference]: Start difference. First operand 8564 states and 11981 transitions. Second operand 9 states. [2019-09-10 04:34:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:21,708 INFO L93 Difference]: Finished difference Result 13303 states and 18527 transitions. [2019-09-10 04:34:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:34:21,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 04:34:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:21,754 INFO L225 Difference]: With dead ends: 13303 [2019-09-10 04:34:21,755 INFO L226 Difference]: Without dead ends: 13297 [2019-09-10 04:34:21,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:34:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13297 states. [2019-09-10 04:34:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13297 to 8768. [2019-09-10 04:34:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8768 states. [2019-09-10 04:34:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8768 states to 8768 states and 12260 transitions. [2019-09-10 04:34:21,994 INFO L78 Accepts]: Start accepts. Automaton has 8768 states and 12260 transitions. Word has length 93 [2019-09-10 04:34:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:21,994 INFO L475 AbstractCegarLoop]: Abstraction has 8768 states and 12260 transitions. [2019-09-10 04:34:21,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:34:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8768 states and 12260 transitions. [2019-09-10 04:34:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:34:21,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:21,997 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] [2019-09-10 04:34:21,997 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1900174843, now seen corresponding path program 1 times [2019-09-10 04:34:21,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:22,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:22,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:22,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:22,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:22,196 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 04:34:22,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:22,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:34:22,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:22,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:34:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:34:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:34:22,198 INFO L87 Difference]: Start difference. First operand 8768 states and 12260 transitions. Second operand 11 states. [2019-09-10 04:34:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:22,336 INFO L93 Difference]: Finished difference Result 9731 states and 13897 transitions. [2019-09-10 04:34:22,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:34:22,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-10 04:34:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:22,367 INFO L225 Difference]: With dead ends: 9731 [2019-09-10 04:34:22,367 INFO L226 Difference]: Without dead ends: 9731 [2019-09-10 04:34:22,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:34:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2019-09-10 04:34:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 9128. [2019-09-10 04:34:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9128 states. [2019-09-10 04:34:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9128 states to 9128 states and 12614 transitions. [2019-09-10 04:34:22,606 INFO L78 Accepts]: Start accepts. Automaton has 9128 states and 12614 transitions. Word has length 94 [2019-09-10 04:34:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:22,607 INFO L475 AbstractCegarLoop]: Abstraction has 9128 states and 12614 transitions. [2019-09-10 04:34:22,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:34:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9128 states and 12614 transitions. [2019-09-10 04:34:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:34:22,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:22,612 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:22,612 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:22,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:22,613 INFO L82 PathProgramCache]: Analyzing trace with hash 869725061, now seen corresponding path program 1 times [2019-09-10 04:34:22,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:22,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:22,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:22,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:22,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:34:23,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:23,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:34:23,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2019-09-10 04:34:23,130 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [187], [188], [189], [191], [200], [206], [208], [210], [216], [219], [224], [227], [231], [244], [246], [247], [248], [251], [267], [269], [271], [274], [278], [280], [281], [304], [307], [311], [313], [314], [317], [320], [325], [328], [335], [337], [340], [344], [346], [347], [370], [373], [377], [379], [380], [381], [382], [385], [401], [403], [405], [408], [412], [414], [415], [418], [420], [423], [425], [429], [430], [431], [432], [433], [434], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447] [2019-09-10 04:34:23,213 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:34:23,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:34:23,338 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:34:24,890 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:34:24,898 INFO L272 AbstractInterpreter]: Visited 109 different actions 1050 times. Merged at 17 different actions 216 times. Widened at 1 different actions 3 times. Performed 11439 root evaluator evaluations with a maximum evaluation depth of 5. Performed 11439 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 8 different actions. Largest state had 114 variables. [2019-09-10 04:34:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:24,903 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:34:25,280 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 77.46% of their original sizes. [2019-09-10 04:34:25,280 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:34:30,597 INFO L420 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2019-09-10 04:34:30,597 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:34:30,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:34:30,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [5] total 84 [2019-09-10 04:34:30,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:30,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 04:34:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 04:34:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=5948, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 04:34:30,602 INFO L87 Difference]: Start difference. First operand 9128 states and 12614 transitions. Second operand 81 states. [2019-09-10 04:38:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:59,048 INFO L93 Difference]: Finished difference Result 14298 states and 20316 transitions. [2019-09-10 04:38:59,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 424 states. [2019-09-10 04:38:59,048 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 146 [2019-09-10 04:38:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:59,097 INFO L225 Difference]: With dead ends: 14298 [2019-09-10 04:38:59,098 INFO L226 Difference]: Without dead ends: 14289 [2019-09-10 04:38:59,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91207 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=13726, Invalid=209530, Unknown=0, NotChecked=0, Total=223256 [2019-09-10 04:38:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2019-09-10 04:38:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 12620. [2019-09-10 04:38:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12620 states. [2019-09-10 04:38:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12620 states to 12620 states and 17391 transitions. [2019-09-10 04:38:59,707 INFO L78 Accepts]: Start accepts. Automaton has 12620 states and 17391 transitions. Word has length 146 [2019-09-10 04:38:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:59,707 INFO L475 AbstractCegarLoop]: Abstraction has 12620 states and 17391 transitions. [2019-09-10 04:38:59,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 04:38:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 12620 states and 17391 transitions. [2019-09-10 04:38:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:38:59,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:59,717 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:38:59,717 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash -729677699, now seen corresponding path program 1 times [2019-09-10 04:38:59,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:59,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:59,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:38:59,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:38:59,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:38:59,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2019-09-10 04:38:59,860 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [187], [188], [189], [191], [200], [206], [208], [210], [216], [219], [224], [227], [231], [244], [246], [247], [248], [251], [267], [269], [271], [274], [278], [280], [281], [304], [307], [311], [313], [314], [337], [340], [344], [346], [347], [350], [353], [358], [361], [368], [370], [373], [377], [379], [380], [381], [382], [385], [401], [403], [405], [408], [412], [414], [415], [418], [420], [423], [425], [429], [430], [431], [432], [433], [434], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447] [2019-09-10 04:38:59,871 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:38:59,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:38:59,904 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:00,979 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:39:00,980 INFO L272 AbstractInterpreter]: Visited 109 different actions 1065 times. Merged at 17 different actions 216 times. Widened at 1 different actions 3 times. Performed 12519 root evaluator evaluations with a maximum evaluation depth of 5. Performed 12519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 6 different actions. Largest state had 114 variables. [2019-09-10 04:39:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:00,980 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:39:01,307 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 85.95% of their original sizes. [2019-09-10 04:39:01,308 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:39:13,067 INFO L420 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2019-09-10 04:39:13,068 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:39:13,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:39:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [84] imperfect sequences [5] total 87 [2019-09-10 04:39:13,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:13,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-10 04:39:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-10 04:39:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=6230, Unknown=0, NotChecked=0, Total=6972 [2019-09-10 04:39:13,070 INFO L87 Difference]: Start difference. First operand 12620 states and 17391 transitions. Second operand 84 states. [2019-09-10 04:41:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:41:00,487 INFO L93 Difference]: Finished difference Result 20582 states and 29219 transitions. [2019-09-10 04:41:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-10 04:41:00,487 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 146 [2019-09-10 04:41:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:41:00,560 INFO L225 Difference]: With dead ends: 20582 [2019-09-10 04:41:00,560 INFO L226 Difference]: Without dead ends: 20582 [2019-09-10 04:41:00,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9339 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=1823, Invalid=23617, Unknown=0, NotChecked=0, Total=25440 [2019-09-10 04:41:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20582 states. [2019-09-10 04:41:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20582 to 19104. [2019-09-10 04:41:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19104 states. [2019-09-10 04:41:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19104 states to 19104 states and 26401 transitions. [2019-09-10 04:41:00,963 INFO L78 Accepts]: Start accepts. Automaton has 19104 states and 26401 transitions. Word has length 146 [2019-09-10 04:41:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:41:00,964 INFO L475 AbstractCegarLoop]: Abstraction has 19104 states and 26401 transitions. [2019-09-10 04:41:00,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-10 04:41:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19104 states and 26401 transitions. [2019-09-10 04:41:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:41:00,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:00,984 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:41:00,984 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1986942413, now seen corresponding path program 1 times [2019-09-10 04:41:00,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:00,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:00,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:41:01,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:41:01,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:41:01,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2019-09-10 04:41:01,101 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [187], [188], [189], [191], [200], [206], [208], [210], [216], [219], [224], [227], [231], [244], [246], [247], [248], [251], [267], [269], [271], [274], [278], [280], [281], [284], [287], [292], [295], [302], [304], [307], [311], [313], [314], [337], [340], [344], [346], [347], [350], [366], [368], [370], [373], [377], [379], [380], [381], [382], [385], [401], [403], [405], [408], [412], [414], [415], [418], [420], [423], [425], [429], [430], [431], [432], [433], [434], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447] [2019-09-10 04:41:01,108 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:41:01,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:41:01,123 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:41:02,693 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:41:02,694 INFO L272 AbstractInterpreter]: Visited 112 different actions 1262 times. Merged at 19 different actions 274 times. Widened at 1 different actions 3 times. Performed 14172 root evaluator evaluations with a maximum evaluation depth of 5. Performed 14172 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 55 fixpoints after 7 different actions. Largest state had 114 variables. [2019-09-10 04:41:02,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:02,694 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:41:02,866 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 77.81% of their original sizes. [2019-09-10 04:41:02,866 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:41:08,332 INFO L420 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2019-09-10 04:41:08,332 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:41:08,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:41:08,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [83] imperfect sequences [5] total 86 [2019-09-10 04:41:08,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:41:08,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-10 04:41:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-10 04:41:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=6239, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 04:41:08,335 INFO L87 Difference]: Start difference. First operand 19104 states and 26401 transitions. Second operand 83 states.