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.7.ufo.BOUNDED-14.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:42:51,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:42:51,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:42:51,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:42:51,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:42:51,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:42:51,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:42:51,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:42:51,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:42:51,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:42:51,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:42:51,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:42:51,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:42:51,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:42:51,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:42:51,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:42:51,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:42:51,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:42:51,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:42:51,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:42:51,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:42:51,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:42:51,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:42:51,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:42:51,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:42:51,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:42:51,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:42:51,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:42:51,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:42:51,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:42:51,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:42:51,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:42:51,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:42:51,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:42:51,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:42:51,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:42:51,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:42:51,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:42:51,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:42:51,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:42:51,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:42:51,673 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:42:51,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:42:51,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:42:51,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:42:51,689 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:42:51,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:42:51,690 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:42:51,690 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:42:51,690 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:42:51,691 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:42:51,691 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:42:51,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:42:51,692 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:42:51,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:42:51,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:42:51,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:42:51,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:42:51,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:42:51,693 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:42:51,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:42:51,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:42:51,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:42:51,694 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:42:51,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:42:51,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:42:51,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:42:51,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:42:51,695 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:42:51,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:42:51,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:42:51,695 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:42:51,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:42:51,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:42:51,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:42:51,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:42:51,740 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:42:51,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2019-09-10 04:42:51,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b807e7b5/2b332ef7ff864be38125b64d54a237a7/FLAG346150400 [2019-09-10 04:42:52,302 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:42:52,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2019-09-10 04:42:52,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b807e7b5/2b332ef7ff864be38125b64d54a237a7/FLAG346150400 [2019-09-10 04:42:52,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b807e7b5/2b332ef7ff864be38125b64d54a237a7 [2019-09-10 04:42:52,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:42:52,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:42:52,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:42:52,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:42:52,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:42:52,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:42:52" (1/1) ... [2019-09-10 04:42:52,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40945f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:52, skipping insertion in model container [2019-09-10 04:42:52,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:42:52" (1/1) ... [2019-09-10 04:42:52,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:42:52,664 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:42:53,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:42:53,084 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:42:53,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:42:53,170 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:42:53,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53 WrapperNode [2019-09-10 04:42:53,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:42:53,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:42:53,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:42:53,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:42:53,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (1/1) ... [2019-09-10 04:42:53,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (1/1) ... [2019-09-10 04:42:53,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (1/1) ... [2019-09-10 04:42:53,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (1/1) ... [2019-09-10 04:42:53,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (1/1) ... [2019-09-10 04:42:53,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (1/1) ... [2019-09-10 04:42:53,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (1/1) ... [2019-09-10 04:42:53,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:42:53,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:42:53,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:42:53,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:42:53,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (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:42:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:42:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:42:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:42:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:42:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:42:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:42:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:42:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:42:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-10 04:42:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:42:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:42:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:42:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:42:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:42:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:42:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:42:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:42:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:42:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:42:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:42:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:42:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:42:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:42:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:42:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:42:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:42:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 04:42:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:42:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:42:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:42:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:42:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:42:54,194 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:42:54,194 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:42:54,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:42:54 BoogieIcfgContainer [2019-09-10 04:42:54,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:42:54,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:42:54,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:42:54,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:42:54,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:42:52" (1/3) ... [2019-09-10 04:42:54,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921a350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:42:54, skipping insertion in model container [2019-09-10 04:42:54,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:42:53" (2/3) ... [2019-09-10 04:42:54,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921a350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:42:54, skipping insertion in model container [2019-09-10 04:42:54,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:42:54" (3/3) ... [2019-09-10 04:42:54,205 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c [2019-09-10 04:42:54,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:42:54,224 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:42:54,241 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:42:54,268 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:42:54,269 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:42:54,269 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:42:54,269 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:42:54,269 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:42:54,270 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:42:54,270 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:42:54,270 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:42:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2019-09-10 04:42:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 04:42:54,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:54,308 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] [2019-09-10 04:42:54,310 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1658309622, now seen corresponding path program 1 times [2019-09-10 04:42:54,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:54,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:54,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:54,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:54,800 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:42:54,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:54,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:54,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:54,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:54,853 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 5 states. [2019-09-10 04:42:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:55,031 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2019-09-10 04:42:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:42:55,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 04:42:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:55,047 INFO L225 Difference]: With dead ends: 169 [2019-09-10 04:42:55,047 INFO L226 Difference]: Without dead ends: 160 [2019-09-10 04:42:55,049 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:42:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-10 04:42:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-10 04:42:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 04:42:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 200 transitions. [2019-09-10 04:42:55,099 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 200 transitions. Word has length 75 [2019-09-10 04:42:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:55,099 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 200 transitions. [2019-09-10 04:42:55,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 200 transitions. [2019-09-10 04:42:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:42:55,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:55,105 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] [2019-09-10 04:42:55,105 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash -456402126, now seen corresponding path program 1 times [2019-09-10 04:42:55,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:55,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:55,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:55,720 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:42:55,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:42:55,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:55,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:42:55,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:42:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:42:55,724 INFO L87 Difference]: Start difference. First operand 160 states and 200 transitions. Second operand 17 states. [2019-09-10 04:43:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:10,591 INFO L93 Difference]: Finished difference Result 2073 states and 3253 transitions. [2019-09-10 04:43:10,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:43:10,592 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 124 [2019-09-10 04:43:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:10,638 INFO L225 Difference]: With dead ends: 2073 [2019-09-10 04:43:10,638 INFO L226 Difference]: Without dead ends: 2073 [2019-09-10 04:43:10,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3673 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1998, Invalid=7122, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:43:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2019-09-10 04:43:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1059. [2019-09-10 04:43:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-09-10 04:43:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1507 transitions. [2019-09-10 04:43:10,858 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1507 transitions. Word has length 124 [2019-09-10 04:43:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:10,863 INFO L475 AbstractCegarLoop]: Abstraction has 1059 states and 1507 transitions. [2019-09-10 04:43:10,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:43:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1507 transitions. [2019-09-10 04:43:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:10,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:10,878 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] [2019-09-10 04:43:10,879 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1039057762, now seen corresponding path program 1 times [2019-09-10 04:43:10,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:10,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:10,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:10,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:11,076 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:43:11,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:11,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:11,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:11,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:11,079 INFO L87 Difference]: Start difference. First operand 1059 states and 1507 transitions. Second operand 5 states. [2019-09-10 04:43:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:11,770 INFO L93 Difference]: Finished difference Result 2867 states and 4083 transitions. [2019-09-10 04:43:11,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:11,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:43:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:11,789 INFO L225 Difference]: With dead ends: 2867 [2019-09-10 04:43:11,790 INFO L226 Difference]: Without dead ends: 2867 [2019-09-10 04:43:11,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:43:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-09-10 04:43:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2863. [2019-09-10 04:43:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2863 states. [2019-09-10 04:43:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 4081 transitions. [2019-09-10 04:43:11,890 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 4081 transitions. Word has length 126 [2019-09-10 04:43:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:11,891 INFO L475 AbstractCegarLoop]: Abstraction has 2863 states and 4081 transitions. [2019-09-10 04:43:11,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4081 transitions. [2019-09-10 04:43:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:11,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:11,896 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] [2019-09-10 04:43:11,896 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash -248644694, now seen corresponding path program 1 times [2019-09-10 04:43:11,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:11,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:11,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:11,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:12,135 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:43:12,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:12,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:12,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:12,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:12,139 INFO L87 Difference]: Start difference. First operand 2863 states and 4081 transitions. Second operand 5 states. [2019-09-10 04:43:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:12,772 INFO L93 Difference]: Finished difference Result 5463 states and 7771 transitions. [2019-09-10 04:43:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:12,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:43:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:12,813 INFO L225 Difference]: With dead ends: 5463 [2019-09-10 04:43:12,814 INFO L226 Difference]: Without dead ends: 5463 [2019-09-10 04:43:12,814 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:43:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-09-10 04:43:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5461. [2019-09-10 04:43:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5461 states. [2019-09-10 04:43:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 7770 transitions. [2019-09-10 04:43:13,059 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 7770 transitions. Word has length 126 [2019-09-10 04:43:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:13,061 INFO L475 AbstractCegarLoop]: Abstraction has 5461 states and 7770 transitions. [2019-09-10 04:43:13,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 7770 transitions. [2019-09-10 04:43:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:13,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:13,067 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] [2019-09-10 04:43:13,069 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:13,070 INFO L82 PathProgramCache]: Analyzing trace with hash 947100576, now seen corresponding path program 1 times [2019-09-10 04:43:13,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:13,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:13,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:13,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:13,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:13,286 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:43:13,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:13,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:13,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:13,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:13,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:13,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:13,288 INFO L87 Difference]: Start difference. First operand 5461 states and 7770 transitions. Second operand 5 states. [2019-09-10 04:43:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:13,942 INFO L93 Difference]: Finished difference Result 10494 states and 14832 transitions. [2019-09-10 04:43:13,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:13,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:43:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:14,009 INFO L225 Difference]: With dead ends: 10494 [2019-09-10 04:43:14,009 INFO L226 Difference]: Without dead ends: 10494 [2019-09-10 04:43:14,010 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:43:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10494 states. [2019-09-10 04:43:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10494 to 10492. [2019-09-10 04:43:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10492 states. [2019-09-10 04:43:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10492 states to 10492 states and 14831 transitions. [2019-09-10 04:43:14,402 INFO L78 Accepts]: Start accepts. Automaton has 10492 states and 14831 transitions. Word has length 126 [2019-09-10 04:43:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:14,403 INFO L475 AbstractCegarLoop]: Abstraction has 10492 states and 14831 transitions. [2019-09-10 04:43:14,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 10492 states and 14831 transitions. [2019-09-10 04:43:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:14,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:14,407 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] [2019-09-10 04:43:14,407 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1143879702, now seen corresponding path program 1 times [2019-09-10 04:43:14,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:14,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:14,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:14,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:14,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:14,564 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:43:14,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:14,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:14,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:14,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:14,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:14,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:14,566 INFO L87 Difference]: Start difference. First operand 10492 states and 14831 transitions. Second operand 5 states. [2019-09-10 04:43:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:15,227 INFO L93 Difference]: Finished difference Result 20154 states and 28296 transitions. [2019-09-10 04:43:15,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:15,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:43:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:15,337 INFO L225 Difference]: With dead ends: 20154 [2019-09-10 04:43:15,338 INFO L226 Difference]: Without dead ends: 20154 [2019-09-10 04:43:15,338 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:43:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20154 states. [2019-09-10 04:43:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20154 to 20152. [2019-09-10 04:43:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20152 states. [2019-09-10 04:43:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20152 states to 20152 states and 28295 transitions. [2019-09-10 04:43:15,959 INFO L78 Accepts]: Start accepts. Automaton has 20152 states and 28295 transitions. Word has length 126 [2019-09-10 04:43:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:15,960 INFO L475 AbstractCegarLoop]: Abstraction has 20152 states and 28295 transitions. [2019-09-10 04:43:15,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20152 states and 28295 transitions. [2019-09-10 04:43:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:15,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:15,963 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] [2019-09-10 04:43:15,963 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1799912160, now seen corresponding path program 1 times [2019-09-10 04:43:15,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:15,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:15,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:15,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:15,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:16,128 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:43:16,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:16,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:16,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:16,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:16,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:16,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:16,130 INFO L87 Difference]: Start difference. First operand 20152 states and 28295 transitions. Second operand 5 states. [2019-09-10 04:43:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:16,843 INFO L93 Difference]: Finished difference Result 38778 states and 53992 transitions. [2019-09-10 04:43:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:16,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:43:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:16,988 INFO L225 Difference]: With dead ends: 38778 [2019-09-10 04:43:16,988 INFO L226 Difference]: Without dead ends: 38778 [2019-09-10 04:43:16,988 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:43:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38778 states. [2019-09-10 04:43:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38778 to 38776. [2019-09-10 04:43:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38776 states. [2019-09-10 04:43:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38776 states to 38776 states and 53991 transitions. [2019-09-10 04:43:18,729 INFO L78 Accepts]: Start accepts. Automaton has 38776 states and 53991 transitions. Word has length 126 [2019-09-10 04:43:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:18,729 INFO L475 AbstractCegarLoop]: Abstraction has 38776 states and 53991 transitions. [2019-09-10 04:43:18,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38776 states and 53991 transitions. [2019-09-10 04:43:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:18,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:18,732 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] [2019-09-10 04:43:18,732 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash 613257386, now seen corresponding path program 1 times [2019-09-10 04:43:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:18,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:18,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:18,864 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:43:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:18,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:18,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:18,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:18,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:18,866 INFO L87 Difference]: Start difference. First operand 38776 states and 53991 transitions. Second operand 5 states. [2019-09-10 04:43:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:19,652 INFO L93 Difference]: Finished difference Result 74418 states and 102752 transitions. [2019-09-10 04:43:19,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:19,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:43:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:19,885 INFO L225 Difference]: With dead ends: 74418 [2019-09-10 04:43:19,885 INFO L226 Difference]: Without dead ends: 74418 [2019-09-10 04:43:19,886 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:43:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74418 states. [2019-09-10 04:43:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74418 to 74416. [2019-09-10 04:43:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74416 states. [2019-09-10 04:43:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74416 states to 74416 states and 102751 transitions. [2019-09-10 04:43:22,631 INFO L78 Accepts]: Start accepts. Automaton has 74416 states and 102751 transitions. Word has length 126 [2019-09-10 04:43:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:22,631 INFO L475 AbstractCegarLoop]: Abstraction has 74416 states and 102751 transitions. [2019-09-10 04:43:22,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 74416 states and 102751 transitions. [2019-09-10 04:43:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:22,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:22,634 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] [2019-09-10 04:43:22,634 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:22,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1860766240, now seen corresponding path program 1 times [2019-09-10 04:43:22,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:22,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:22,760 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:43:22,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:22,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:22,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:22,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:22,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:22,762 INFO L87 Difference]: Start difference. First operand 74416 states and 102751 transitions. Second operand 5 states. [2019-09-10 04:43:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:25,543 INFO L93 Difference]: Finished difference Result 142338 states and 194912 transitions. [2019-09-10 04:43:25,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:25,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:43:25,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:25,950 INFO L225 Difference]: With dead ends: 142338 [2019-09-10 04:43:25,950 INFO L226 Difference]: Without dead ends: 142338 [2019-09-10 04:43:25,951 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:43:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142338 states. [2019-09-10 04:43:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142338 to 142336. [2019-09-10 04:43:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142336 states. [2019-09-10 04:43:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142336 states to 142336 states and 194911 transitions. [2019-09-10 04:43:28,555 INFO L78 Accepts]: Start accepts. Automaton has 142336 states and 194911 transitions. Word has length 126 [2019-09-10 04:43:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:28,555 INFO L475 AbstractCegarLoop]: Abstraction has 142336 states and 194911 transitions. [2019-09-10 04:43:28,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 142336 states and 194911 transitions. [2019-09-10 04:43:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:43:28,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:28,557 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] [2019-09-10 04:43:28,558 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash 222538090, now seen corresponding path program 1 times [2019-09-10 04:43:28,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:28,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:28,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:28,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:31,367 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:43:31,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:31,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:43:31,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:31,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:43:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:43:31,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:43:31,369 INFO L87 Difference]: Start difference. First operand 142336 states and 194911 transitions. Second operand 17 states. [2019-09-10 04:43:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:47,436 INFO L93 Difference]: Finished difference Result 326588 states and 511949 transitions. [2019-09-10 04:43:47,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:43:47,436 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-10 04:43:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:48,543 INFO L225 Difference]: With dead ends: 326588 [2019-09-10 04:43:48,544 INFO L226 Difference]: Without dead ends: 326588 [2019-09-10 04:43:48,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3713 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2040, Invalid=7080, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:43:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326588 states. [2019-09-10 04:43:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326588 to 194752. [2019-09-10 04:43:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194752 states. [2019-09-10 04:44:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194752 states to 194752 states and 267039 transitions. [2019-09-10 04:44:02,235 INFO L78 Accepts]: Start accepts. Automaton has 194752 states and 267039 transitions. Word has length 126 [2019-09-10 04:44:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:02,236 INFO L475 AbstractCegarLoop]: Abstraction has 194752 states and 267039 transitions. [2019-09-10 04:44:02,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:44:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 194752 states and 267039 transitions. [2019-09-10 04:44:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:44:02,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:02,237 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] [2019-09-10 04:44:02,238 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash 463021734, now seen corresponding path program 1 times [2019-09-10 04:44:02,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:02,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:02,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:02,352 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:44:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:44:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:44:02,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:44:02,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:44:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:44:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:44:02,354 INFO L87 Difference]: Start difference. First operand 194752 states and 267039 transitions. Second operand 9 states. [2019-09-10 04:44:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:04,125 INFO L93 Difference]: Finished difference Result 240003 states and 330523 transitions. [2019-09-10 04:44:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:44:04,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2019-09-10 04:44:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:05,820 INFO L225 Difference]: With dead ends: 240003 [2019-09-10 04:44:05,821 INFO L226 Difference]: Without dead ends: 240003 [2019-09-10 04:44:05,821 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:44:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240003 states. [2019-09-10 04:44:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240003 to 219845. [2019-09-10 04:44:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219845 states. [2019-09-10 04:44:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219845 states to 219845 states and 302543 transitions. [2019-09-10 04:44:13,976 INFO L78 Accepts]: Start accepts. Automaton has 219845 states and 302543 transitions. Word has length 126 [2019-09-10 04:44:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:13,977 INFO L475 AbstractCegarLoop]: Abstraction has 219845 states and 302543 transitions. [2019-09-10 04:44:13,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:44:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 219845 states and 302543 transitions. [2019-09-10 04:44:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:44:13,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:13,978 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] [2019-09-10 04:44:13,979 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:13,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1528434433, now seen corresponding path program 1 times [2019-09-10 04:44:13,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:13,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:13,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:14,161 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:44:14,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:44:14,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:44:14,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:44:14,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:44:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:44:14,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:44:14,163 INFO L87 Difference]: Start difference. First operand 219845 states and 302543 transitions. Second operand 11 states. [2019-09-10 04:44:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:16,335 INFO L93 Difference]: Finished difference Result 255400 states and 369491 transitions. [2019-09-10 04:44:16,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:44:16,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-10 04:44:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:17,278 INFO L225 Difference]: With dead ends: 255400 [2019-09-10 04:44:17,278 INFO L226 Difference]: Without dead ends: 255400 [2019-09-10 04:44:17,278 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:44:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255400 states. [2019-09-10 04:44:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255400 to 232517. [2019-09-10 04:44:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232517 states. [2019-09-10 04:44:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232517 states to 232517 states and 315535 transitions. [2019-09-10 04:44:26,401 INFO L78 Accepts]: Start accepts. Automaton has 232517 states and 315535 transitions. Word has length 127 [2019-09-10 04:44:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:26,402 INFO L475 AbstractCegarLoop]: Abstraction has 232517 states and 315535 transitions. [2019-09-10 04:44:26,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:44:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 232517 states and 315535 transitions. [2019-09-10 04:44:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:44:26,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:26,403 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] [2019-09-10 04:44:26,403 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash 346953462, now seen corresponding path program 1 times [2019-09-10 04:44:26,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:26,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:26,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:26,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:26,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:26,548 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:44:26,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:44:26,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:44:26,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:44:26,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:44:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:44:26,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:44:26,550 INFO L87 Difference]: Start difference. First operand 232517 states and 315535 transitions. Second operand 7 states. [2019-09-10 04:44:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:28,670 INFO L93 Difference]: Finished difference Result 328606 states and 445669 transitions. [2019-09-10 04:44:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:44:28,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2019-09-10 04:44:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:34,394 INFO L225 Difference]: With dead ends: 328606 [2019-09-10 04:44:34,394 INFO L226 Difference]: Without dead ends: 328606 [2019-09-10 04:44:34,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:44:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328606 states. [2019-09-10 04:44:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328606 to 303557. [2019-09-10 04:44:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303557 states. [2019-09-10 04:44:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303557 states to 303557 states and 410221 transitions. [2019-09-10 04:44:39,431 INFO L78 Accepts]: Start accepts. Automaton has 303557 states and 410221 transitions. Word has length 127 [2019-09-10 04:44:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:39,431 INFO L475 AbstractCegarLoop]: Abstraction has 303557 states and 410221 transitions. [2019-09-10 04:44:39,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:44:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 303557 states and 410221 transitions. [2019-09-10 04:44:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:44:39,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:39,535 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, 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, 1, 1, 1, 1, 1, 1, 1, 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:44:39,535 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:39,536 INFO L82 PathProgramCache]: Analyzing trace with hash -598279232, now seen corresponding path program 1 times [2019-09-10 04:44:39,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:39,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:44:39,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:39,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:44:39,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:44:39,662 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], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [326], [332], [335], [340], [343], [347], [360], [362], [363], [364], [387], [390], [394], [396], [397], [400], [416], [418], [420], [423], [427], [429], [430], [433], [449], [451], [453], [456], [460], [462], [463], [466], [482], [484], [486], [489], [493], [495], [496], [497], [498], [501], [517], [519], [521], [524], [528], [530], [531], [534], [536], [539], [541], [542], [545], [561], [563], [565], [568], [572], [574], [575], [578], [581], [586], [589], [596], [598], [601], [605], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633] [2019-09-10 04:44:39,741 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:44:39,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:44:39,939 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:44:44,089 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:44:44,092 INFO L272 AbstractInterpreter]: Visited 151 different actions 2398 times. Merged at 25 different actions 560 times. Widened at 1 different actions 4 times. Performed 31934 root evaluator evaluations with a maximum evaluation depth of 7. Performed 31934 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 143 fixpoints after 8 different actions. Largest state had 154 variables. [2019-09-10 04:44:44,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:44,097 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:44:44,854 INFO L227 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 77.87% of their original sizes. [2019-09-10 04:44:44,854 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:44:57,482 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 04:44:57,482 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:44:57,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:44:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [5] total 105 [2019-09-10 04:44:57,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:44:57,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-10 04:44:57,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-10 04:44:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=854, Invalid=9448, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 04:44:57,495 INFO L87 Difference]: Start difference. First operand 303557 states and 410221 transitions. Second operand 102 states. [2019-09-10 04:47:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:34,547 INFO L93 Difference]: Finished difference Result 253728 states and 366847 transitions. [2019-09-10 04:47:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-09-10 04:47:34,547 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 193 [2019-09-10 04:47:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:35,339 INFO L225 Difference]: With dead ends: 253728 [2019-09-10 04:47:35,340 INFO L226 Difference]: Without dead ends: 253722 [2019-09-10 04:47:35,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20959 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=4756, Invalid=60014, Unknown=0, NotChecked=0, Total=64770 [2019-09-10 04:47:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253722 states. [2019-09-10 04:47:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253722 to 224268. [2019-09-10 04:47:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224268 states. [2019-09-10 04:47:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224268 states to 224268 states and 303068 transitions. [2019-09-10 04:47:42,416 INFO L78 Accepts]: Start accepts. Automaton has 224268 states and 303068 transitions. Word has length 193 [2019-09-10 04:47:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:42,416 INFO L475 AbstractCegarLoop]: Abstraction has 224268 states and 303068 transitions. [2019-09-10 04:47:42,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-10 04:47:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 224268 states and 303068 transitions. [2019-09-10 04:47:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:47:42,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:42,527 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:42,527 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1748263958, now seen corresponding path program 1 times [2019-09-10 04:47:42,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:42,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:42,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:42,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:42,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:47:43,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:47:43,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:47:43,133 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:47:43,135 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], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [326], [332], [335], [340], [343], [347], [360], [362], [363], [364], [367], [370], [375], [378], [385], [387], [390], [394], [396], [397], [400], [416], [418], [420], [423], [427], [429], [430], [433], [449], [451], [453], [456], [460], [462], [463], [466], [482], [484], [486], [489], [493], [495], [496], [497], [498], [501], [517], [519], [521], [524], [528], [530], [531], [534], [536], [539], [541], [542], [545], [561], [563], [565], [568], [572], [574], [575], [578], [594], [596], [598], [601], [605], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633] [2019-09-10 04:47:43,147 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:47:43,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:47:43,173 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:47:47,747 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:47:47,748 INFO L272 AbstractInterpreter]: Visited 154 different actions 3284 times. Merged at 27 different actions 811 times. Widened at 1 different actions 6 times. Performed 42889 root evaluator evaluations with a maximum evaluation depth of 7. Performed 42889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 222 fixpoints after 10 different actions. Largest state had 154 variables. [2019-09-10 04:47:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:47,749 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:47:48,222 INFO L227 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 83.55% of their original sizes. [2019-09-10 04:47:48,222 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:48:14,891 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 04:48:14,891 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:48:14,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:48:14,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [109] imperfect sequences [21] total 128 [2019-09-10 04:48:14,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:14,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-10 04:48:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-10 04:48:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1419, Invalid=10353, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 04:48:14,896 INFO L87 Difference]: Start difference. First operand 224268 states and 303068 transitions. Second operand 109 states. [2019-09-10 04:51:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:51:49,925 INFO L93 Difference]: Finished difference Result 267816 states and 388158 transitions. [2019-09-10 04:51:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-10 04:51:49,925 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 193 [2019-09-10 04:51:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:51:50,669 INFO L225 Difference]: With dead ends: 267816 [2019-09-10 04:51:50,669 INFO L226 Difference]: Without dead ends: 267816 [2019-09-10 04:51:50,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10662 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=2616, Invalid=26454, Unknown=0, NotChecked=0, Total=29070 [2019-09-10 04:51:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267816 states. [2019-09-10 04:51:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267816 to 240668. [2019-09-10 04:51:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240668 states. [2019-09-10 04:51:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240668 states to 240668 states and 325014 transitions. [2019-09-10 04:51:55,687 INFO L78 Accepts]: Start accepts. Automaton has 240668 states and 325014 transitions. Word has length 193 [2019-09-10 04:51:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:51:55,688 INFO L475 AbstractCegarLoop]: Abstraction has 240668 states and 325014 transitions. [2019-09-10 04:51:55,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-10 04:51:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 240668 states and 325014 transitions. [2019-09-10 04:51:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:51:55,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:51:55,728 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:51:55,729 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:51:55,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:51:55,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1817043562, now seen corresponding path program 1 times [2019-09-10 04:51:55,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:51:55,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:51:55,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:51:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:51:55,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:51:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:51:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:51:56,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:51:56,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:51:56,207 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:51:56,209 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], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [326], [332], [335], [340], [343], [347], [360], [362], [363], [364], [367], [383], [385], [387], [390], [394], [396], [397], [400], [416], [418], [420], [423], [427], [429], [430], [433], [449], [451], [453], [456], [460], [462], [463], [466], [482], [484], [486], [489], [493], [495], [496], [497], [498], [501], [517], [519], [521], [524], [528], [530], [531], [534], [536], [539], [541], [542], [545], [548], [553], [556], [563], [565], [568], [572], [574], [575], [578], [594], [596], [598], [601], [605], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633] [2019-09-10 04:51:56,213 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:51:56,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:51:56,240 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:51:59,553 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:51:59,554 INFO L272 AbstractInterpreter]: Visited 154 different actions 2864 times. Merged at 27 different actions 682 times. Widened at 1 different actions 5 times. Performed 38425 root evaluator evaluations with a maximum evaluation depth of 7. Performed 38425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 181 fixpoints after 10 different actions. Largest state had 154 variables. [2019-09-10 04:51:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:51:59,554 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:51:59,859 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 89.93% of their original sizes. [2019-09-10 04:51:59,859 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:52:25,467 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 04:52:25,468 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:52:25,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:52:25,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [104] imperfect sequences [21] total 123 [2019-09-10 04:52:25,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:25,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-10 04:52:25,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-10 04:52:25,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=9761, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 04:52:25,471 INFO L87 Difference]: Start difference. First operand 240668 states and 325014 transitions. Second operand 104 states.